Decomposition approaches for recoverable robust optimization problems

DOI10.1016/j.ejor.2015.12.008zbMath1346.90726OpenAlexW1604943196MaRDI QIDQ322768

J. M. van den Akker, P. C. Bouman, Hoogeveen, J. A., Denise D. Tönissen

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://dspace.library.uu.nl/handle/1874/340328

zbMATH Keywords

shortest pathcolumn generationknapsackbranch-and-pricerecoverable robustness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (max. 100)

Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem ⋮ A survey of adjustable robust optimization

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Recoverable robust knapsacks: the discrete scenario case
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
• Where are the hard knapsack problems?
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Recoverable robust shortest path problems
• Robust train routing and online re-scheduling
• Recoverable Robustness for Railway Rolling Stock Planning
• Packing a Knapsack of Unknown Capacity
• Recoverable Robust Knapsacks: Γ-Scenarios
• Recoverable Robustness by Column Generation
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Recoverable Robustness in Shunting and Timetabling
• Introduction to Stochastic Programming
• Approximation Algorithms for the Weight-Reducible Knapsack Problem

This page was built for publication: Decomposition approaches for recoverable robust optimization problems