A branch and bound algorithm for robust binary optimization with budget uncertainty

DOI10.1007/S12532-022-00232-2MaRDI QIDQ6175705zbMATHOpenAlexFDO

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

Publication date 24 July 2023

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12532-022-00232-2

zbMATH Keywords

combinatorial optimizationmathematical programmingrobust optimizationbranch and boundcomputation

Mathematics Subject Classification ID

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

Recommendations

• Oracle-based algorithms for binary two-stage robust optimization
• Robust combinatorial optimization with variable budgeted uncertainty
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
• Robust binary optimization using a safe tractable approximation
• \(K\)-adaptability in two-stage robust binary programming

Cites work

• A Computational Study of Search Strategies for Mixed Integer Programming
• 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
• An Automatic Method of Solving Discrete Programming Problems
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Branching and bounds tighteningtechniques for non-convex MINLP
• Branching rules revisited
• Conflict graphs in solving integer programming problems
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Integer Programming
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Mixed integer programming: analyzing 12 years of progress
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• On learning and branching: a survey
• On the robust knapsack problem
• Preprocessing and cutting planes with conflict graphs
• Presolve Reductions in Mixed Integer Programming
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• Recent advances in robust optimization: an overview
• Reducibility among combinatorial problems
• 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
• Strong formulations of robust mixed 0-1 programming
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Price of Robustness
• The feasibility pump
• The mixed vertex packing problem.
• Theory and applications of robust optimization
• Where are the hard knapsack problems?

Cited in

(3)

• A Lagrangian dual method for two-stage robust optimization with binary uncertainties
• Recycling inequalities for robust combinatorial optimization with budget uncertainty
• Oracle-based algorithms for binary two-stage robust optimization

This page was built for publication: A branch and bound algorithm for robust binary optimization with budget uncertainty

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