Exact solution of the robust knapsack problem

Computers and Operations Research

Volumn 40, Issue 11, 2013, Pages 2625-2631

  Monaci, Michele ^a   Pferschy, Ulrich ^b   Serafini, Paolo ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF GRAZ   (Austria)

^c UNIVERSITY OF UDINE   (Italy)

Author keywords

Dynamic programming; Knapsack problem; Robust optimization

Indexed keywords

DYNAMIC PROGRAMMING ALGORITHM; EXACT ALGORITHMS; EXACT SOLUTION; KNAPSACK PROBLEMS; ROBUST OPTIMIZATION; SPACE AND TIME COMPLEXITY; UPPER BOUND;

ALGORITHMS; DYNAMIC PROGRAMMING; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION;

EID: 84879042687     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.05.005     Document Type: Article

References (19)

1. Álvarez-Miranda E, Ljubic I, Toth P. A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR. In press, http://dx.doi.org/10.1007/s10288-013-0231-6.
2. D. Bertsimas, D.B. Brown, and C. Caramanis Theory and applications of robust optimization SIAM Review 53 2011 464 501
3. D. Bertsimas, and M. Sim Robust discrete optimization and network flows Mathematical Programming 98 2003 49 71
4. D. Bertsimas, and M. Sim The price of robustness Operations Research 52 2004 35 53
5. Büsing C, Koster AMCA, Kutschka M. Recoverable robust knapsacks: Γ-scenarios. In: Proceedings of INOC 2011, international network optimization conference, lecture notes in computer science 6701. Springer; 2011. pp. 583-8.
6. C. Büsing, A.M.C.A. Koster, and M. Kutschka Recoverable robust knapsacks the discrete scenario case Optimization Letters 5 2011 379 392
7. A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger Approximation algorithms for knapsack problems with cardinality constraints European Journal of Operational Research 123 2000 333 345
8. M. Fischetti, and M. Monaci Cutting plane versus compact formulations for uncertain (integer) linear programs Mathematical Programming Computation 4 2012 239 273
9. H. Kellerer, and U. Pferschy A new fully polynomial approximation scheme for the knapsack problem Journal of Combinatorial Optimization 3 1999 59 71
10. H. Kellerer, and U. Pferschy Improved dynamic programming in connection with an FPTAS for the knapsack problem Journal of Combinatorial Optimization 8 2004 5 12
11. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack problems 2004 Springer
12. O. Klopfenstein, and D. Nace A robust approach to the chance-constrained knapsack problem Operations Research Letters 36 2008 628 632
13. O. Klopfenstein, and D. Nace Cover inequalities for robust knapsack sets - application to the robust bandwidth packing problem Networks 59 2012 59 72
14. 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 Operations Research 60 2012 604 610
15. S. Martello, D. Pisinger, and P. Toth Dynamic programming and strong bounds for the 0-1 knapsack problem Management Science 3 1999 414 424
16. Monaci M, Pferschy U. On the robust knapsack problem. Submitted manuscript, available as Optimization Online 2011-04-3019; 2012.
17. U. Pferschy Dynamic programming revisited improving knapsack algorithms Computing 63 1999 419 430
18. D. Pisinger Where are the hard knapsack problems? Computers and Operations Research 32 2005 2271 2284
19. M. Poss Robust combinatorial optimization with variable budgeted uncertainty 4OR 11 2013 75 92