Approximating the stochastic knapsack problem: The benefit of adaptivity

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 208-217

  Dean, Brian C ^a   Goemans, Michel X ^b   Vondrák, Jan ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

ADAPTIVE POLICY; APPROXIMATION ALGORITHMS; RANDOM VALUES; STOCHASTIC KNAPSACK PROBLEM;

COMPUTATIONAL COMPLEXITY;

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

References (14)

1. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Computer and System Sciences, 36(2):254-276, 1988.
2. J. Birge and F. Louveaux. Introduction to Stochastic Programming. Springer Verlag, 1997.
3. R. Carraway, R.L.Schmidt, and L. Weatherford. An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns. Naval Research Logistics, 40:161-173, 1993.
4. A. Condon, J. Feigenbaum, C. Lund, and P. Shor. Random debaters and the hardness of approximating stochastic functions. SIAM J. Computing, 26:369-400, 1997.
5. C. Derman, C. Lieberman, and S. Ross. A renewal decision problem. Management Science, 24(5):554-561, 1978.
6. A. Goel and P. Indyk. Stochastic load balancing and related problems. In FOCS, pages 579-586, 1999.
7. M. Henig. Risk criteria in a stochastic knapsack problem. Operations Research, 38(5):820-825, 1990.
8. N. Immorlica, D. Karger, M. Minkoff, and V. Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In SODA, pages 184-693, 2004.
9. J. Kleinberg, Y. Rabani, and E. Tardos. Allocating bandwidth for bursty connections. In STOC, pages 664-673, 1997.
10. C. Papadimitriou. Games against nature. J. of Computer and System Sciences, 31:288-301, 1985.
11. M. Rothkopf. Scheduling with random service times. Management Science, 12(9):707-713, 1966.
12. M. Sniedovich. Preference order stochastic knapsack problems: methodological issues. The Journal of the Operational Research Society, 31(11): 1025-1032, 1980.
13. E. Steinberg and M. Parks. A preference order dynamic program for a knapsack problem with stochastic rewards. The Journal of the Operational Research Society, 30(2): 141-147, 1979.
14. M. Uetz. Algorithms for deterministic and stochastic scheduling. PhD thesis, Institut für Mathematik, Technische Universität Berlin, 2001.