ParaSCIP: A Parallel Extension of SCIP
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.
Supported by the DFG Research Center Matheon Mathematics for key technologies in Berlin. We are thankful to the HRLN II supercompter stuff, a specially Bernd Kallies and Hinnerk Stüben which gave us support at any time we needed it.
- 1.Gurobi Optimizer. http://www.gurobi.com/
- 2.HLRN – Norddeutscher Verbund zur Förderung des Hoch- und Höchstleistungsrechnens. http://www.hlrn.de/
- 3.IBM ILOG CPLEX Optimizer. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/
- 4.Mixed Integer Problem Library (MIPLIB) 2003. http://miplib.zib.de/
- 5.SCIP: Solving Constraint Integer Programs. http://scip.zib.de/
- 6.TOP500 Supercomputer Sites. http://www.top500.org/list/2010/11/100
- 7.Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin (2007)Google Scholar
- 11.Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: A test set of mixed integer programming problems. SIAM News 25, 16 (1992)Google Scholar
- 12.Karp, R.M.: Reducibility among combinatorial problems. In: R.E. Miller, J.W. Thatcher (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York, USA (1972)Google Scholar
- 14.Mittelmann, H.: Mixed integer linear programming benchmark (serial codes). http://plato.asu.edu/ftp/milpf.html
- 17.Shinano, Y., Achterberg, T., t: Fujie: A dynamic load balancing mechanism for new paralex. In: Proceedings of ICPADS 2008, pp. 455–462 (2008)Google Scholar