TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards

References

• Bertsekas D. P.Dynamic Programming: Deterministic and Stochastic Models (1987) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Bertsekas D. P., Castanon D. A. Rollout algorithms for stochastic scheduling problems. J. Heuristics (1999) 5(1):89–108Crossref, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, New York) Google Scholar
• Carraway R., Schmidt R., Weatherford L. An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns. Naval Res. Logist. (1993) 40(2):161–173Crossref, Google Scholar
• Charnes A., Cooper W. W. Chance-constrainted programming. Management Sci. (1959) 6(1):73–79Link, Google Scholar
• Dantzig G. B. Discrete-variable extremum problems. Oper. Res. (1957) 5(2):266–277Link, Google Scholar
• Dean B. C., Goemans M. X., Vondrak J. Approximating the stochastic knapsack problem: The benefit of adaptivity. 45th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2004) (2004) (IEEE Computer Society, Washington, DC) 208–217Crossref, Google Scholar
• Goel A., Indyk P. Stochastic load balancing and related problems. 40th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS'99) (1999) (IEEE Computer Society, Washington, DC) 579–586Crossref, Google Scholar
• Henig M. Risk criteria in a stochastic knapsack problem. Oper. Res. (1990) 38(5):820–825Link, Google Scholar
• Kleinberg J., Rabani Y., Tardos E. Allocating bandwidth for bursty connections. Proc. 29th ACM Sympos. Theory Comput. (1997) (ACM, New York) 664–673Crossref, Google Scholar
• Kleywegt A. J., Papastavrou J. D. The dynamic and stochastic knapsack problem with random sized items. Oper. Res. (2001) 49(1):26–41Link, Google Scholar
• Kusic D., Kandasamy N. Risk-aware limited lookahead control for dynamic resource provisioning in enterprise computing systems. Cluster Comput. (2007) 10(4):395–408Crossref, Google Scholar
• Morton D. P., Wood R., Woodruff D. On a stochastic knapsack problem and generalizations. Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search (1998) (Kluwer, Boston) 149–168Crossref, Google Scholar
• Novoa C., Storer R. An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. (2009) 196(2):509–515Crossref, Google Scholar
• Prékopa A.Stochastic Programming (1995) (Kluwer, Boston) Crossref, Google Scholar
• Slyke V. R., Young Y. Finite horizon stochastic knapsacks with applications to yield management. Oper. Res. (2000) 48(1):155–172Link, Google Scholar
• Sniedovich M. Preference order stochastic knapsack problems: Methodological issues. J. Oper. Res. Soc. (1980) 31(11):1025–1032Crossref, Google Scholar
• Steinberg E., Parks M. S. A preference order dynamic program for a knapsack problem with stochastic rewards. J. Oper. Res. Soc. (1979) 30(2):141–147Crossref, Google Scholar