The multi-band robust knapsack problem -- a dynamic programming approach

DOI10.1016/j.disopt.2015.09.007zbMath1387.90267OpenAlexW2161937787MaRDI QIDQ1751135

Grit Claßen, Anke Schmeink, Arie M. C. A. Koster

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.09.007

zbMATH Keywords

knapsack problemdynamic programmulti-band robustness

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (4)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ On probabilistic algorithm for solving almost all instances of the set partition problem ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ A survey of decision making and optimization under uncertainty

Uses Software

• CPLEX
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact solution of the robust knapsack problem
• A robust approach to the chance-constrained knapsack problem
• Robust discrete optimization and network flows
• Where are the hard knapsack problems?
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Strong formulations of robust mixed 0-1 programming
• Theory and Applications of Robust Optimization
• The Price of Robustness
• A Minimal Algorithm for the 0-1 Knapsack Problem

This page was built for publication: The multi-band robust knapsack problem -- a dynamic programming approach