The Three Phases of MIP Solving

Please always quote using this URN: urn:nbn:de:0297-zib-61607
  • Modern MIP solvers employ dozens of auxiliary algorithmic components to support the branch-and-bound search in finding and improving primal solutions and in strengthening the dual bound. Typically, all components are tuned to minimize the average running time to prove optimality. In this article, we take a different look at the run of a MIP solver. We argue that the solution process consists of three different phases, namely achieving feasibility, improving the incumbent solution, and proving optimality. We first show that the entire solving process can be improved by adapting the search strategy with respect to the phase-specific aims using different control tunings. Afterwards, we provide criteria to predict the transition between the individual phases and evaluate the performance impact of altering the algorithmic behavior of the MIP solver SCIP at the predicted phase transition points.

Download full text files

Export metadata

  • Export Bibtex
Metadaten
Author:Timo Berthold, Gregor Hendel, Thorsten Koch
Document Type:ZIB-Report
Tag:adaptive search behavior; branch-and-bound; mixed-integer programming; optimality prediction; optimization software
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
CCS-Classification:G. Mathematics of Computing
Date of first Publication:2016/12/30
Series (Serial Number):ZIB-Report (16-78)
ISSN:1438-0064

$Rev: 13581 $