Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs

DOI10.1287/ijoc.1100.0405zbMath1243.90251OpenAlexW2135937941MaRDI QIDQ2899130

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

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

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

Related Items

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

Uses Software

• MIPLIB
• MIPLIB2003