Approximating the stochastic knapsack problem: The benefit of adaptivity

Mathematics of Operations Research

Volumn 33, Issue 4, 2008, Pages 945-964

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

^a CLEMSON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Department of Mathematics ^*  (United States)

Author keywords

Adaptivity; Approximation algorithm; Knapsack problem; Stochastic models

Indexed keywords

0/1 KNAPSACK PROBLEMS; A-PRIORI; ADAPTIVE POLICIES; ADAPTIVITY; ARBITRARY DISTRIBUTIONS; DYNAMIC CHOICES; EXPECTED VALUES; FIXED SEQUENCES; KNAPSACK PROBLEM; NONADAPTIVE POLICIES; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; STOCHASTIC KNAPSACK PROBLEMS;

ADAPTIVE ALGORITHMS; APPROXIMATION ALGORITHMS; INTEGER PROGRAMMING; OPTIMIZATION; RANDOM PROCESSES; RANDOM VARIABLES; STOCHASTIC CONTROL SYSTEMS;

STOCHASTIC MODELS;

EID: 61449225483     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0330     Document Type: Article

References (27)

1. Birge, J. R., F. V. Louveaux. 1997. Introduction to Stochastic Programming. Springer Verlag, New York.
2. Carraway, R. L., R. L. Schmidt, L. R. Weatherford. 1993. An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns. Naval Res. Logist. 40 161-173.
3. Chang, C.-S., X. Chao, M. Pinedo, R. R. Weber. 1992. On the optimality of LEPT and cμ rules for machines in parallel. J. Appl. Probab. 29 667-681.
4. Dean, B. C. 2005. Approximation algorithms for stochastic scheduling problems. Ph.D. thesis, Massachusetts Institute of Technology, Boston.
5. Dean, B. C., M. X. Goemans, J. Vondrák. 2004. Approximating the stochastic knapsack problem: The benefit of adaptivity. Proc. 45th IEEE Sympos. Found. Comput. Sci. (FOCS), Rome, 208-217.
6. Derman, C., C. J. Lieberman, S. M. Ross. 1978. A renewal decision problem.. Management Sci. 24(5) 554-561.
7. Emmons, H., M. Pinedo. 1990. Scheduling stochastic jobs with due dates on parallel machines. Eur: J. Oper: Res. 47 49-55.
8. Feige, U. 2004. On the sum of independent random variables with unbounded variance, and estimating the average degree in a graph. Proc. 36th ACM-SIAM Sympos. Discrete Algorithms (SODA), 594-603.
9. Goel, A., P. Indyk. 1999. Stochastic load balancing and related problems. Proc. 40th IEEE Found. Comput. Sci., 579-586.
10. Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. S 287-326.
11. Henig, M. 1990. Risk criteria in a stochastic knapsack problem. Oper. Res. 38(5) 820-825.
12. Immorlica, N., D. Karger, M. Minkoff, V. Mirrokni. 2004. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, 184-693.
13. Kleinberg, J., Y. Rabani, E. Tardos. 1997. Allocating bandwidth for bursty connections. Proc. 29th ACM Sympos. Theory Comput., 664-673.
14. Kleywegt, A., J. D. Papastavrou. 2001. The dynamic and stochastic knapsack problem with random sized items. Oper. Res. 49(1) 26-41.
15. Koutsoupks, E., C. H. Papadimitriou. 2000. Beyond competitive analysis. SIAM J. Comput. 30(1) 300-317.
16. Mohring, R. H., A. S. Schulz, M. Uetz. 1999. Approximation in stochastic scheduling: The power of LP-based priority policies. J. ACM 46(6) 924-942.
17. Papastavrou, J. D., S. Rajagopalan, A. Kleywegt. 1996. The dynamic and stochastic knapsack problem with deadlines. Management Sci.. 42(12) 1706-1718.
18. Pinedo, M. 1983. Stochastic scheduling with release dates and due dates. Oper. Res. 31 559-572.
19. Ravi, R., A. Sinha. 2004. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Proc. 10th Integer Programming Combin. Optim. (IPCO), 101-115.
20. Rothkopf, M. 1966. Scheduling with random service times. Management Sci. 12(9) 707-713.
21. Schrijver, A. 2003. Combinatorial Optimization-Polyhedra and Effidency. Springer Verlag, Berlin.
22. Shmoys, D. B., C. Swamy. 2004. Stochastic optimization is (almost) as easy as deterministic optimization. Proc. 45th IEEE Found. Comput. Sci. (FOCS), 228-237.
23. Skutella, M., M. Uetz. 2005. Stochastic machine scheduling with precedence constraints. SIAM J. Comput. 34(4) 788-802.
24. Sniedovich, M. 1980. Preference order stochastic knapsack problems: Methodological issues. J. Oper: Res. Soc. 31(11) 1025-1032.
25. Steinberg, E., M. S. Parks. 1979. A preference order dynamic program for a knapsack problem with stochastic rewards. J. Oper: Res. Soc. 30(2) 141-147.
26. Uetz, M. 2001. Algorithms for deterministic and stochastic scheduling. Ph.D. thesis, Institut für Mathematik, Technische Universität Berlin.
27. Vondrák, J. 2005. Probabilistic methods in combinatorial and stochastic optimization. Ph.D. thesis, Massachusetts Institute of Technology, Boston.