Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models

References

• [1] Aviv Y, Federgruen A (1997) Stochastic inventory models with limited production capacity and periodically varying parameters. Probab. Engrg. Inform. Sci. 11(1):107–135.Crossref, Google Scholar
• [2] Begen MA, Queyranne M (2011) Appointment scheduling with discrete random durations. Math. Oper. Res. 36(2):240–257.Link, Google Scholar
• [3] Begen, MA, Levi R, Queyranne M (2012) A sampling-based approach to appointment scheduling. Oper. Res. 60(3):675–681.Link, Google Scholar
• [4] Charikar M, Chekuri C, Pal M (2005) Sampling bounds for stochastic optimization. Chekuri C, Jansen K, Rolim JDP, Trevisan L, eds. Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, Lecture Notes in Computer Science, vol. 3624 (Springer, Berlin), 257–269.Crossref, Google Scholar
• [5] Cover TM, Thomas JA (2006) Elements of Information Theory, Wiley Series in Telecommunications and Signal Processing (Wiley-Interscience, New York).Google Scholar
• [6] Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., New York).Google Scholar
• [7] Gupta A, Ravi R, Sinha A (2007) LP rounding approximation algorithms for stochastic network design. Math. Oper. Res. 32(2):345–364.Link, Google Scholar
• [8] Gupta A, Pál M, Ravi R, Sinha A (2004) Boosted sampling: Approximation algorithms for stochastic optimization. Proc. 36th Annual ACM Sympos. Theory Comput. (STOC ’04) (ACM, New York), 417–426.Crossref, Google Scholar
• [9] Gupta A, Pál M, Ravi R, Sinha A (2005) What about Wednesday? Approximation algorithms for multistage stochastic optimization. Chekuri C, Jansen K, Rolim JDP, Trevisan L, eds. Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, Lecture Notes in Computer Science, vol. 3624 (Springer, Berlin), 86–98.Crossref, Google Scholar
• [10] Halman N (2015) Provably near-optimal approximation schemes for sample-based dynamic programs with emphasis on stochastic inventory control models. Working paper, Hebrew University of Jerusalem, Jerusalem.Google Scholar
• [11] Halman N, Klabjan D, Li C, Orlin J, Simchi-Levi D (2014) Fully polynomial time approximation schemes for stochastic dynamic programs. SIAM J. Discrete Math. 28(4):1725–1796.Crossref, Google Scholar
• [12] Halman N, Klabjan D, Mostagir M, Orlin J, Simchi-Levi D (2009) A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand. Math. Oper. Res. 34(3):674–685.Link, Google Scholar
• [13] Immorlica N, Karger D, Minkoff M, Mirrokni VS (2004) On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA ’04) (ACM, New York), 691–700.Google Scholar
• [14] Kapuściński R, Tayur S (1998) A capacitated production-inventory model with periodic demand. Oper. Res. 46(6):899–911.Link, Google Scholar
• [15] Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• [16] Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.Link, Google Scholar
• [17] Levi R, Roundy RO, Shmoys DB (2006) Provably near-optimal sampling-based algorithms for stochastic inventory control models. Proc. 38th Annual ACM Sympos. Theory Comput. (STOC ’06) (ACM, New York), 739–748.Crossref, Google Scholar
• [18] Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.Link, Google Scholar
• [19] Levi R, Roundy RO, Shmoys DB, Truong VA (2008) Approximation algorithms for capacitated stochastic inventory control models. Oper. Res. 56(5):1184–1199.Link, Google Scholar
• [20] Massart P (1990) The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality. Ann. Probab. 18(3):1269–1283.Crossref, Google Scholar
• [21] Ravi R, Sinha A (2006) Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Math. Program. 108(1):97–114.Crossref, Google Scholar
• [22] Shapiro A (2006) On complexity of multistage stochastic programs. Oper. Res. Lett. 34(1):1–8.Crossref, Google Scholar
• [23] Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. Jeyakumar V, Rubinov A, eds. Continuous Optimization, Applied Optimization, vol. 99 (Springer, Boston), 111–146.Crossref, Google Scholar
• [24] Shapiro A, Dentcheva D, Ruszczyski A (2009) Lectures on Stochastic Programming: Modeling and Theory (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [25] Shmoys DB, Swamy C (2006) An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6):978–1012.Crossref, Google Scholar
• [26] Swamy C, Shmoys D (2012) Sampling-based approximation algorithms for multistage stochastic optimization. SIAM J. Comput. 41(4):975–1004.Crossref, Google Scholar
• [27] Tayur SR (1993) Computing the optimal policy for capacitated inventory models. Comm. Statist. Stoch. Models 9(4):585–598.Crossref, Google Scholar