Predicting the solution time of branch-and-bound algorithms for mixed-integer programs

DOI10.1287/IJOC.1100.0405MaRDI QIDQ2899130zbMATH OpenOpenAlexFDO

Authors Osman Y. Özaltın, Brady Hunsaker, Andrew J. Schaefer

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f8b5630280a3c3a16a0cd149edbdb72e53954636

zbMATH Keywords

branch-and-bound algorithmmixed-integer programmingtime prediction

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Recommendations

• Early estimates of the size of branch-and-bound trees
• Branch-and-bound solves random binary IPs in poly(n)-time
• Further results on an abstract model for branching and its application to mixed integer programming
• An intelligent algorithm for mixed-integer programming models
• A two-stage parallel branch and bound algorithm for mixed integer programs

Cited in

(6)

• Estimating the Size of Branch-and-Bound Trees
• Could we use a million cores to solve an integer program?
• SelfSplit parallelization for mixed-integer linear programming
• Early estimates of the size of branch-and-bound trees
• Shortest path network interdiction with asymmetric uncertainty
• On estimating workload in interval branch-and-bound global optimization algorithms

Describes a project that uses

Uses Software

• MIPLIB2003
• MIPLIB

This page was built for publication: Predicting the solution time of branch-and-bound algorithms for mixed-integer programs

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