A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

References

• Dean B. C., Goemans M. X., Vondrák J. Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res. (2008) 33:945–964Link, Google Scholar
• Dyer M. Approximate counting by dynamic programming. Proc. 35th Annual Sympos. Theory Comput. (2003) (ACM, New York) 693–699Crossref, Google Scholar
• Dyer M., Frieze A., Jerrum M. Approximately counting Hamilton paths and cycles in dense graphs. SIAM J. Comput. (1998) 27:1262–1272Crossref, Google Scholar
• Dyer M., Goldberg L. A., Greenhill C., Jerrum M. The relative complexity of approximate counting problems. Algorithmica (2003) 38:471–500Crossref, Google Scholar
• Federgruen A., Zipkin P. H. Computational issues in an infinite-horizon, multi-echelon inventory model. Oper. Res. (1984) 32:818–836Link, Google Scholar
• Federgruen A., Zipkin P. H. An efficient algorithm for computing optimal (s, S) policies. Oper. Res. (1984) 32:1268–1286Link, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, New York) Google Scholar
• Jerrum M., Sinclair A. Approximating the permanent. SIAM J. Comput. (1989) 18:1149–1178Crossref, Google Scholar
• Jerrum M., Sinclair A., Vigoda E. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM (2004) 51(4):671–697Crossref, Google Scholar
• Levi R., Roundy R., Shmoys D. B. Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. (2007) 32:821–838Link, Google Scholar
• Levi R., Pal M., Roundy R., Shmoys D. B. Approximation algorithms for stochastic inventory control models. Math. Oper. Res. (2007) 32:284–302Link, Google Scholar
• Levi R., Roundy R., Shmoys D. B., Truong V. A. Approximation algorithms for capacitated stochastic inventory control problems. Oper. Res. (2008) 56:1186–1199Link, Google Scholar
• Mihail M., Winkler P. On the number of Eulerian orientations of a graph. Algorithmica (1995) 16:402–414Crossref, Google Scholar
• Porteus E. L.Foundations of Stochastic Inventory Theory (2002) (Stanford University Press, Stanford, CA) Crossref, Google Scholar
• Preparata F. P., Shamos M. I.Computational Geometry: An Introduction (1985) (Springer-Verlag, New York) Crossref, Google Scholar
• Roth D. On the hardness of approximate reasoning. Artificial Intelligence (1996) 82:273–302Crossref, Google Scholar
• Roundy R., Muckstadt J. A. Heuristic computation of periodic-review base stock inventory policies. Management Sci. (2000) 46:104–109Link, Google Scholar
• Safer H., Orlin J. Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. (1995) . Working Paper 3757-95, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Shmoys D. B., Swamy C. An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM (2006) 53:973–1012Crossref, Google Scholar
• Simchi-Levi D., Chen X., Bramel J.The Logic of Logistics: Theory, Algorithms, and Applications for Logistics and Supply Chain Management (2005) 2nd ed.(Springer-Verlag, New York) Google Scholar
• Swamy C., Shmoys D. B. Sampling-based approximation algorithms for multi-stage stochastic optimization. 46th Annual IEEE Sympos. Foundations Comput. Sci. (2005) Pittsburgh:357–366Google Scholar
• Van Hoesel C. P. M., Wagelmans A. P. M. Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. (2001) 26:339–357Link, Google Scholar
• Weitz D. Counting independent sets up to the tree threshold. Proc. 38th Annual Sympos. Theory Comput. (2006) (ACM, New York) 140–149Crossref, Google Scholar
• Woeginger G. J. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. Comput. (2000) 12:57–75Link, Google Scholar
• Zheng Y. Z., Federgruen A. Finding optimal (s, S) policies is about as simple as evaluating a single policy. Oper. Res. (1991) 39:654–665Link, Google Scholar
• Zipkin P. H.Foundations of Inventory Management (2000) (McGraw-Hill, Burr Ridge, IL) Google Scholar