Recoverable Robustness by Column Generation

DOI10.1007/978-3-642-23719-5_19zbMath1346.90693OpenAlexW36784663MaRDI QIDQ3092230

P. C. Bouman, Hoogeveen, J. A., J. M. van den Akker

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_19

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

Packing a Knapsack of Unknown Capacity ⋮ Decomposition approaches for recoverable robust optimization problems ⋮ Robust storage loading problems with stacking and payload constraints ⋮ On the recoverable robust traveling salesman problem ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ A biobjective approach to recoverable robustness based on location planning

This page was built for publication: Recoverable Robustness by Column Generation