Recoverable robustness by column generation

DOI10.1007/978-3-642-23719-5_19MaRDI QIDQ3092230zbMATH OpenOpenAlexFDO

Authors P. C. Bouman, J. M. van den Akker, Han Hoogeveen

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)

Recommendations

• Decomposition approaches for recoverable robust optimization problems
• Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
• Recoverable Robustness in Shunting and Timetabling
• Recoverable robust knapsacks: -scenarios
• Recoverable robustness for railway rolling stock planning

Cited in

(7)

• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
• A biobjective approach to recoverable robustness based on location planning
• Recoverable robust knapsacks: -scenarios
• Decomposition approaches for recoverable robust optimization problems
• Robust storage loading problems with stacking and payload constraints
• On the recoverable robust traveling salesman problem
• Packing a knapsack of unknown capacity

This page was built for publication: Recoverable robustness by column generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092230)