Recoverable robust knapsacks: the discrete scenario case
From MaRDI portal
Publication:691430
DOI10.1007/s11590-011-0307-1zbMath1262.90142MaRDI QIDQ691430
Arie M. C. A. Koster, Christina Büsing, Manuel Kutschka
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0307-1
90C27: Combinatorial optimization
Related Items
Packing a Knapsack of Unknown Capacity, Decomposition approaches for recoverable robust optimization problems, Exact solution of the robust knapsack problem, The robust knapsack problem with queries, Robust combinatorial optimization under convex and discrete cost uncertainty, Recoverable robust knapsacks: the discrete scenario case, Speeding up column generation for robust wireless network planning, Lot sizing with storage losses under demand uncertainty, Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem, On recoverable and two-stage robust selection problems with budgeted uncertainty, A biobjective approach to recoverable robustness based on location planning, A note on upper bounds to the robust knapsack problem with discrete scenarios, Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem, The recoverable robust spanning tree problem with interval costs is polynomially solvable, Recoverable robust spanning tree problem under interval uncertainty representations, Robust recoverable and two-stage selection problems, ROPI—a robust optimization programming interface for C++
Uses Software
Cites Work
- Unnamed Item
- Recoverable robust knapsacks: the discrete scenario case
- SCIP: solving constraint integer programs
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- A note on the max-min 0-1 knapsack problem
- On the \(0/1\) knapsack polytope
- Robust discrete optimization and network flows
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Separation algorithms for 0-1 knapsack polytopes
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Recoverable Robustness in Shunting and Timetabling
- Solving Large-Scale Zero-One Linear Programming Problems
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
