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

DOI10.1007/S12532-022-00232-2zbMATH Open1517.90082OpenAlexW4317805267MaRDI QIDQ6175705FDOQ6175705

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

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

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)

Cites Work

• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• A Computational Study of Search Strategies for Mixed Integer Programming
• An Automatic Method of Solving Discrete Programming Problems
• Reducibility among Combinatorial Problems
• Recent advances in robust optimization: an overview
• Theory and Applications of Robust Optimization
• Title not available (Why is that?)
• The Price of Robustness
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Where are the hard knapsack problems?
• Branching rules revisited
• The feasibility pump
• Mixed Integer Programming: Analyzing 12 Years of Progress
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robust convex optimization
• Conflict graphs in solving integer programming problems
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• On the Robust Knapsack Problem
• The mixed vertex packing problem.
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• Branching and bounds tighteningtechniques for non-convex MINLP
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Strong formulations of robust mixed 0-1 programming
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• Presolve Reductions in Mixed Integer Programming
• Integer Programming
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• On learning and branching: a survey
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• Preprocessing and cutting planes with conflict graphs

Cited In (1)

• Recycling inequalities for robust combinatorial optimization with budget uncertainty

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)