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

  title={Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs},
  author={Osman Y. {\"O}zaltin and B. Hunsaker and A. Schaefer},
  journal={INFORMS J. Comput.},
  • Osman Y. Özaltin, B. Hunsaker, A. Schaefer
  • Published 2011
  • Computer Science
  • INFORMS J. Comput.
  • The most widely used progress measure for branch-and-bound (B&B) algorithms when solving mixed-integer programs (MIPs) is the MIP gap. We introduce a new progress measure that is often much smoother than the MIP gap. We propose a double exponential smoothing technique to predict the solution time of B&B algorithms and evaluate the prediction method using three MIP solvers. Our computational experiments show that accurate predictions of the solution time are possible, even in the early stages of… CONTINUE READING
    The SCIP Optimization Suite 5.0
    • 204
    • Highly Influenced
    • PDF
    Could we use a million cores to solve an integer program?
    • 40
    • PDF
    Parallel Solvers for Mixed Integer Linear Optimization
    • 11
    • PDF
    Parallel Solvers for Mixed Integer Linear Programming
    • 8
    • PDF
    What could a million CPUs do to solve Integer Programs
    • 3
    • PDF


    Publications referenced by this paper.
    Estimating the efficiency of backtrack programs.
    • 304
    • PDF
    Early Estimates of the Size of Branch-and-Bound Trees
    • 50
    • PDF
    An introduction to Kalman filter
    • 3,260
    • PDF
    Miplib 2003
    • 213
    • Highly Influential
    • PDF
    Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
    • P. Chen
    • Mathematics, Computer Science
    • 1992
    • 74
    • PDF
    Estimating Search Tree Size
    • 67
    • PDF
    Tree Size by Partial Backtracking
    • 55
    Double Exponential Smoothing: An Alternative to Kalman Filter-Based Predictive Tracking
    • 115
    • PDF