Parallel Solvers for Mixed Integer Linear Programming

Please always quote using this URN: urn:nbn:de:0297-zib-62239
  • In this article, we introduce parallel mixed integer linear programming (MILP) solvers. MILP solving algorithms have been improved tremendously in the last two decades. Currently, commercial MILP solvers are known as a strong optimization tool. Parallel MILP solver development has started in 1990s. However, since the improvements of solving algorithms have much impact to solve MILP problems than application of parallel computing, there were not many visible successes. With the spread of multi-core CPUs, current state-of-the-art MILP solvers have parallel implementations and researches to apply parallelism in the solving algorithm also getting popular. We summarize current existing parallel MILP solver architectures.

Download full text files

Export metadata

  • Export Bibtex
Author:Ted Ralphs, Yuji Shinano, Timo Berthold, Thorsten Koch
Document Type:ZIB-Report
Tag:branch-and-bound; integer programming; parallel computing; supercomputing
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C11 Mixed integer programming
Date of first Publication:2016/12/24
Series (Serial Number):ZIB-Report (16-74)

$Rev: 13581 $