Decomposition approaches for recoverable robust optimization problems

Keyphrases

• Decomposition Approach 100%
• Robust Optimization Problem 100%
• Computational Experiment 50%
• Planning Problem 50%
• LP Relaxation 50%
• Planning Strategy 50%
• Robust Knapsack Problem 50%
• Recoverable Robustness 50%
• Knapsack 50%
• Optimization Programming 50%
• Recovery Action 50%
• Robust Optimization 50%
• Life Planning 50%
• Robust Shortest Path Problems 50%
• Stochastic Programming 50%
• Branch-and-cut 50%
• Recourse Action 50%

Mathematics

• Edge 100%
• Dominates 100%
• Path Problem 100%
• Branch And Price 100%
• Stochastics 100%
• Real Life 100%

Computer Science

• Optimization Problem 100%
• Robust Optimization 100%
• Stochastic Programming 33%
• Knapsack Problem 33%
• Knapsack 33%
• Shortest Path Problem 33%
• Computational Experiment 33%