Recycling inequalities for robust combinatorial optimization with budget uncertainty

DOI10.1007/978-3-031-32726-1_5OpenAlexW4377200009MaRDI QIDQ6085989

Christina Büsing, Timo Gersing, Arie M. C. A. Koster

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-32726-1_5

zbMATH Keywords

integer programmingcombinatorial optimizationrobust optimizationpolyhedral combinatorics

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Robust discrete optimization and network flows
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• Strong formulations of robust mixed 0-1 programming
• Integer Programming
• The Price of Robustness
• On the facial structure of set packing polyhedra
• A branch and bound algorithm for robust binary optimization with budget uncertainty