Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes

We consider a version of the knapsack problem in which an item size is random and revealed only when the decision maker attempts to insert it. After every successful insertion the decision maker ca...

[1]  C. Derman,et al.  A Renewal Decision Problem , 1978 .

[2]  E. Steinberg,et al.  A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards , 1979 .

[3]  Moshe Sniedovich,et al.  Preference Order Stochastic Knapsack Problems: Methodological Issues , 1980 .

[4]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[5]  P. Schweitzer,et al.  Generalized polynomial approximations in Markovian decision processes , 1985 .

[6]  H. Ishii,et al.  Stochastic linear knapsack programming problem and its application to a portfolio selection problem , 1989 .

[7]  Mordechai I. Henig.  Risk Criteria in a Stochastic Knapsack Problem , 1990, Oper. Res..

[8]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[9]  R. Carraway,et al.  An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns , 1993 .

[10]  J. Papastavrou,et al.  The Dynamic and Stochastic Knapsack Problem with Deadlines , 1996 .

[11]  Stanley E. Zin,et al.  SPLINE APPROXIMATIONS TO VALUE FUNCTIONS: Linear Programming Approach , 1997 .

[12]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem , 1998, Oper. Res..

[13]  Ashish Goel,et al.  Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[14]  Yuval Rabani,et al.  Allocating Bandwidth for Bursty Connections , 2000, SIAM J. Comput..

[15]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem with Random Sized Items , 2001, Oper. Res..

[16]  Dorit S. Hochbaum,et al.  Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations , 2002, Eur. J. Oper. Res..

[17]  Benjamin Van Roy,et al.  The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..

[18]  Daniel Adelman,et al.  Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing , 2003, Manuf. Serv. Oper. Manag..

[19]  J. Vondrák.  Probabilistic Methods in Combinatorial and Stochastic Optimization , 2005 .

[20]  J. Vondrák,et al.  Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity , 2008 .

[21]  R. Ravi,et al.  A PTAS for the chance-constrained knapsack problem with random item sizes , 2010, Oper. Res. Lett..

[22]  R. Ravi,et al.  Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[23]  Ashish Goel,et al.  Improved approximation results for stochastic knapsack problems , 2011, SODA '11.

[24]  Mark S. Daskin,et al.  TECHNICAL NOTE - The Adaptive Knapsack Problem with Stochastic Rewards , 2011, Oper. Res..

[25]  Joseph Geunes,et al.  The static stochastic knapsack problem with normally distributed item sizes , 2012, Math. Program..