Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty

DOI10.1007/S10107-024-02135-7MaRDI QIDQ7019075zbMATH OpenFDO

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

Publication date 5 March 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-024-02135-7

zbMATH Keywords

combinatorial optimizationcomputationinteger programmingpolyhedral combinatoricsrobust optimization

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Mixed integer programming (90C11) Robustness in mathematical programming (90C17) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A branch and bound algorithm for robust binary optimization with budget uncertainty
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• Combinatorial optimization. Theory and algorithms
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Fast robust shortest path computations
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• Integer Programming
• Lifting the facets of zero–one polytopes
• Measuring the impact of primal heuristics
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• On the facial structure of set packing polyhedra
• Recent advances in robust optimization: an overview
• Recycling inequalities for robust combinatorial optimization with budget uncertainty
• Robust convex optimization
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust optimization
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust solutions of uncertain linear programs
• Sequence independent lifting in mixed integer programming
• Strong formulations of robust mixed 0-1 programming
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• The Price of Robustness
• Theory and applications of robust optimization

Cited in

(1)

• The robust multicrew scheduling and routing problem in road restoration

This page was built for publication: Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty

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