On the robust knapsack problem

SIAM Journal on Optimization

Volumn 23, Issue 4, 2013, Pages 1956-1982

  Monaci, Michele ^a   Pferschy, Ulrich ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF GRAZ   (Austria)

Author keywords

Knapsack problem; Robust optimization; Worst case ratio

Indexed keywords

CLASSICAL PROBLEMS; COMBINATORIAL ALGORITHM; KNAPSACK PROBLEMS; OPTIMAL SOLUTIONS; ROBUST OPTIMIZATION; WORST-CASE PERFORMANCE; WORST-CASE PERFORMANCE RATIO; WORST-CASE RATIO;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMAL SYSTEMS; UNCERTAINTY ANALYSIS;

PROBLEM SOLVING;

EID: 84892895321     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/120880355     Document Type: Article

References (25)

1. H. Aissi, C. Bazgan, and D. Vanderpooten, Approximation of min-max and minmax regret versions of some combinatorial optimization problems, European J. Oper. Res., 179 (2007), pp. 281-290.
2. E. Álvarez-Miranda, I. Ljubic, and P. Toth, A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems, 4OR, to appear.
3. A. Atamtürk, Strong formulations of robust mixed 0-1 programming, Math. Program., 108 (2006), pp. 235-250.
4. A. Ben-Tal and A. Nemirovski, Robust convex optimization, Math. Oper. Res., 23 (1998), pp. 769-805.
5. A. Ben-Tal and A. Nemirovski, Robust solutions of linear programming problems contaminated with uncertain data, Math. Program., 88 (2000), pp. 411-424.
6. D. Bertsimas, D. Brown, and C. Caramanis, Theory and applications of robust optimization, SIAM Rev., 53 (2011), pp. 464-501.
7. D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Math. Program., 98 (2003), pp. 49-71.
8. D. Bertsimas and M. Sim, The price of robustness, Oper. Res., 52 (2004), pp. 35-53.
9. C. Büsing, A. Koster, and M. Kutschka, Recoverable robust knapsacks: Γ-scenarios, in Proceedings of INOC 2011, International Network Optimization Conference, Lecture Notes in Comput. Sci. 6701, J. Pahl, T. Reiners, and S. Voß, eds., Springer-Verlag, Berlin, 2011, pp. 583-588.
10. C. Büsing, A. Koster, and M. Kutschka, Recoverable robust knapsacks: The discrete scenario case, Optim. Lett., 5 (2011), pp. 379-392.
11. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001.
12. G. Dantzig, Discrete variables extremum problems, Oper. Res., 5 (1957), pp. 266-277.
13. B. Fortz, M. Labbé, F. Louveaux, and M. Poss, Stochastic binary problems with simple penalties for capacity constraints violations, Math. Program., 138 (2013), pp. 199-221.
14. B. Fortz and M. Poss, Easy distributions for combinatorial optimization problems with probabilistic constraints, Oper. Res. Lett., 38 (2010), pp. 545-549.
15. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, Berlin, 2004.
16. O. Klopfenstein and D. Nace, A robust approach to the chance-constrained knapsack problem, Oper. Res. Lett., 36 (2008), pp. 628-632.
17. O. Klopfenstein and D. Nace, Cover inequalities for robust knapsack sets-application to the robust bandwidth packing problem, Networks, 59 (2012), pp. 59-72.
18. C. Lee, K. Lee, K. Park, and S. Park, Technical note-branch-and-price- and-cut approach to the robust network design problem without flow bifurcations, Oper. Res., 60 (2012), pp. 604-610.
19. H. Lida, A note on the max-min 0-1 knapsack problem, J. Comb. Optim., 3 (1999), pp. 89-94.
20. C. Liebchen, M. Lübbecke, R. Möhring, and S. Stiller, The concept of recoverable robustness, linear programming recovery, and railways applications, in Robust and Online Large-Scale Optimization, Lecture Notes in Comput. Sci. 5868, R. Ahuja, R. Moehring, and C. Zaroliagis, eds., Springer-Verlag, Berlin, 2009, pp. 1-27.
21. M. Monaci, U. Pferschy, and P. Serafini, Exact solution of the robust knapsack problem, Comput. Oper. Res., 40 (2013), pp. 2625-2631.
22. M. Pinar, A note on robust 0-1 optimization with uncertain cost coefficients, 4OR, 2 (2004), pp. 309-316.
23. M. Poss, Robust combinatorial optimization with variable budgeted uncertainty, 4OR, 11 (2013), pp. 75-92.
24. A. Soyster, Convex programming with set-inclusive constraints and applications to inexact linear programming, Oper. Res., 21 (1973), pp. 1154-1157.
25. G. Yu, On the max-min 0-1 knapsack problem with robust optimization applications, Oper. Res., 44 (1996), pp. 407-415.