Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem

DOI10.1007/s13675-018-0107-9zbMath1430.90420OpenAlexW2898945074MaRDI QIDQ2329707

Arie M. C. A. Koster, Christina Büsing, Manuel Kutschka, Sebastian Goderbauer

Publication date: 18 October 2019

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-018-0107-9

zbMATH Keywords

knapsackrecoverable robustness\({\varGamma}\)-robustnessbudget uncertaintyinteger programming under uncertainty

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact solution of the robust knapsack problem
• Recoverable robust knapsacks: the discrete scenario case
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust discrete optimization and network flows
• Where are the hard knapsack problems?
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Separation algorithms for 0-1 knapsack polytopes
• Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
• The Recoverable Robust Two-Level Network Design Problem
• Recoverable Robust Knapsacks: Γ-Scenarios
• Cutting-set methods for robust convex optimization with pessimizing oracles
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Recoverable Robustness in Shunting and Timetabling
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Reducibility among Combinatorial Problems
• On the Robust Knapsack Problem
• Canonical Cuts on the Unit Hypercube

This page was built for publication: Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem