ParaSCIP: A Parallel Extension of SCIP

  • Yuji Shinano
  • Tobias Achterberg
  • Timo Berthold
  • Stefan Heinz
  • Thorsten Koch
Conference paper

DOI: 10.1007/978-3-642-24025-6_12

Cite this paper as:
Shinano Y., Achterberg T., Berthold T., Heinz S., Koch T. (2011) ParaSCIP: A Parallel Extension of SCIP. In: Bischof C., Hegering HG., Nagel W., Wittum G. (eds) Competence in High Performance Computing 2010. Springer, Berlin, Heidelberg

Abstract

Mixed integer programming (MIP)has become one of the most important techniques in Operations Research and Discrete Optimization. SCIP (Solving Constraint Integer Programs) is currently one of the fastest non-commercial MIP solvers. It is based on the branchandboundprocedure in which the problem is recursively split into smaller subproblems, thereby creating a so-called branching tree. We present ParaSCIP, an extension of SCIP, which realizes a parallelization on a distributed memory computing environment. ParaSCIP uses SCIP solvers as independently running processes to solve subproblems (nodes of the branching tree) locally. This makes the parallelization development independent of the SCIP development. Thus, ParaSCIP directly profits from any algorithmic progress in future versions of SCIP. Using a first implementation of ParaSCIP, we were able to solve two previously unsolved instances from MIPLIB2003, a standard test set library for MIP solvers. For these computations, we used up to 2048 cores of the HLRN II supercomputer.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yuji Shinano
    • 1
  • Tobias Achterberg
    • 2
  • Timo Berthold
    • 1
  • Stefan Heinz
    • 1
  • Thorsten Koch
    • 1
  1. 1.Zuse Institute BerlinBerlinGermany
  2. 2.IBM Deutschland GmbHBad Homburg v.d.H.Germany