Recoverable Robust Knapsacks: Γ-Scenarios

DOI10.1007/978-3-642-21527-8_65zbMath1348.90535OpenAlexW91408871MaRDI QIDQ3091540

Manuel Kutschka, Christina Büsing, Arie M. C. A. Koster

Publication date: 9 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_65

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

Decomposition approaches for recoverable robust optimization problems, The robust knapsack problem with queries, Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem, Robust flows with losses and improvability in evacuation planning, Recoverable robust representatives selection problems with discrete budgeted uncertainty, Improved handling of uncertainty and robustness in set covering problems, Robust combinatorial optimization under convex and discrete cost uncertainty, The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach, Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem