ParaSCIP
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.
Keywords for this software
References in zbMATH (referenced in 22 articles )
Showing results 1 to 20 of 22.
Sorted by year (- Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
- Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2018)
- Berthold, Timo; Hendel, Gregor; Koch, Thorsten: From feasibility to improvement to proof: three phases of solving mixed-integer programs (2018)
- Gurski, Frank; Rethmann, Jochen: Distributed solving of mixed-integer programs with GLPK and Thrift (2018)
- Helm, Werner E.; Justkowiak, Jan-Erik: Extension of Mittelmann’s benchmarks: comparing the solvers of SAS and Gurobi (2018)
- Kimura, Keiji; Waki, Hayato: Minimization of Akaike’s information criterion in linear regression analysis via mixed integer nonlinear program (2018)
- Munguía, Lluís-Miquel; Ahmed, Shabbir; Bader, David A.; Nemhauser, George L.; Shao, Yufen: Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (2018)
- Shinano, Yuji; Berthold, Timo; Heinz, Stefan: ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (2018)
- Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)
- Gamrath, Gerald; Koch, Thorsten; Maher, Stephen J.; Rehfeldt, Daniel; Shinano, Yuji: SCIP-Jack -- a solver for STP and variants with parallelization extensions (2017)
- Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2016)
- Fischetti, Matteo; Lodi, Andrea; Monaci, Michele; Salvagnin, Domenico; Tramontani, Andrea: Improving branch-and-cut performance by random sampling (2016)
- Keiji Kimura, Hayato Waki: Minimization of Akaike’s Information Criterion in Linear Regression Analysis via Mixed Integer Nonlinear Program (2016) arXiv
- Kimura, Keiji; Waki, Hayato: Mixed integer nonlinear program for minimization of Akaike’s information criterion (2016)
- Shinano, Yuji; Berthold, Timo; Heinz, Stefan: A first implementation of paraxpress: combining internal and external parallelization to solve MIPs on supercomputers (2016)
- Eckstein, Jonathan; Hart, William E.; Phillips, Cynthia A.: PEBBL: an object-oriented framework for scalable parallel branch and bound (2015)
- Mason, Luke R.; Mak-Hau, Vicky H.; Ernst, Andreas T.: A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (2015)
- Gamrath, Gerald: Improving strong branching by domain propagation (2014)
- Gamrath, Gerald: Improving strong branching by propagation (2013)
- Koch, Thorsten; Ralphs, Ted; Shinano, Yuji: Could we use a million cores to solve an integer program? (2012)