Fully Polynomial Time Approximation Schemes for stochastic dynamic programs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 700-709

  Halman, Nir ^a   Klabjan, Diego ^b   Li, Chung Lun ^c   Orlin, James ^d   Simchi Levi, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^d NONE

Author keywords

[No Author keywords available]

Indexed keywords

NP HARD PROBLEMS; UNIVARIATE;

COST FUNCTIONS; FUNCTIONS; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS;

POLYNOMIAL APPROXIMATION;

EID: 51849137610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. J. Adda and R. Cooper. Dynamic Economics: Quantitive Methods and Applications. MIT Press, 2003.
2. M. Alekhnovich, A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo, A. Magen, and T. Pitassi. Towards a model for backtracking and dynamic programming. In Proceedings of the 20th IEEE Conference on Computational Complexity, 2005.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, 1999.
4. A. Bandyopadhyay and D. Gamarnik. Counting without sampling, new algorithms for enumeration problems using statistical physics. To Appear in Random Structures and Algorithms, 2007.
5. M. Bayati, D. Gamarnik, D. Katz, C. Nair, and P. Tetali. Simple deterministic approximation algorithms for counting matchings. In Proceedings of the 39th A CM Symposium on Theory of Computing, 2007.
6. R. Bellman. Applied Dynamic Programming. Princeton University MIT Press, Princeton, NJ, 1957.
7. D.P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA, 1995.
8. T.C.E. Cheng, Z.-L. Chen, C.-L. Li, and B.M.-T. Lin. Scheduling to minimize the total compression and late costs. Naval Research Logistics, 45:67-82, 1998.
9. B.C. Dean, M. X. Goemans, and J. Vondrák. Approximating the stochastic knapsack problem: the benefit of adaptivity. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
10. M. Dyer. Approximate counting by dynamic programming. In Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, pages 693-699, 2003.
11. M. Dyer, A. Frieze, and M. Jerrum. Approximately counting Hamilton paths and cycles in dense graphs. SIAM Journal on Computing, 27:1262-1272, 1998.
12. M. Dyer, L.A. Goldberg, C. Greenhill, and M. Jerrum. The relative complexity of approximate counting problems. Algorithmica, 38:471-500, 2003.
13. D. Gamarnik and D. Katz. Correlation decay and deterministic fptas for counting list-colorings of a graph. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, 2007.
14. N. Halman, D. Klabjan, M. Mostagir, J. Orlin, and D. Simchi-Levi. A fully polynomial time approximation scheme for single-item stochastic inventory control with discrete demand. Technical report, Massachusetts Institute of Technology, 2006. Submitted for journal publication.
15. K. Hinderer and K.-H. Waldmann. Cash management in a randomly varying environment. European Journal of Operational Research, 130:468-485, 2001.
16. D.S. Hochbaum. A nonlinear knapsack problem. Operations Research Letters, 17:103-110, 1995.
17. D.S. Hochbaum. Various notions of approximations: Good, better, best, and more. In D.S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 346-398. PWS Publishing company, 1997.
18. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23:317-327, 1976.
19. O.H. Ibarra and C.E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22:463-468, 1975.
20. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal on Computing, 18:1149-1178, 1989.
21. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM, 51(4):671-697, 2004.
22. R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
23. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springier-Verlag, 2004.
24. M. Mihail and P. Winkler. On the number of Eulerian orientations of a graph. Algorithmica, 16:402-414, 1995.
25. K.P. Papadaki and W.B. Powell. An adaptive dynamic programming algorithm for stochastic multiproduct batch dispatch problem. Naval Research Logistics, 50:742-769, 2003.
26. E. Phelps. The accumulation of risky capital: A sequential utility analysis. Econometrica, 30:729-743, 1962.
27. H. Safer and J. Orlin. Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Sloan school working paper 3757-95, Massachusetts Institute of Technology, 1995.
28. S. Sahni. Algorithms for scheduling independent tasks. Journal of the ACM, 23:116-127, 1976.
29. I. Saniee. An efficient algorithm for the multiperiod capacity expansion of one location in telecommunications. Operations Research, 43:187-190, 1995.
30. V.J. Vazirani. Approximation Algorithms. Springler-Verlag, 2001.
31. D. Weitz. Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
32. G. J. Woeginger. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12:57-75, 2000.