ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers

The Ubiquity Generator (UG) is a general framework for the external parallelization of mixed integer programming (MIP) solvers. In this paper, we present ParaXpress, a distributed memory parallelization of the powerful commercial MIP solver FICO Xpress. Besides sheer performance, an important feature of Xpress is that it provides an internal parallelization for shared memory systems. When aiming for a best possible performance of ParaXpress on a supercomputer, the question arises how to balance the internal Xpress parallelization and the external parallelization by UG against each other. We provide computational experiments to address this question and we show computational results for running ParaXpress on a Top500 supercomputer, using up to 43,344 cores in parallel.

[1]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[2]  Andrea Lodi,et al.  MIPLIB 2010 , 2011, Math. Program. Comput..

[3]  Timo Berthold,et al.  A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers , 2016, ICMS.

[4]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[5]  Cynthia A. Phillips,et al.  PEBBL: an object-oriented framework for scalable parallel branch and bound , 2015, Mathematical Programming Computation.

[6]  Yuji Shinano,et al.  A Dynamic Load Balancing Mechanism for New ParaLEX , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.

[7]  Thorsten Koch,et al.  ParaSCIP: A Parallel Extension of SCIP , 2010, CHPC.

[8]  Michael C. Ferris,et al.  Grid-Enabled Optimization with GAMS , 2009, INFORMS J. Comput..

[9]  Laxmikant V. Kalé,et al.  Parssse: an Adaptive Parallel State Space Search Engine , 2011, Parallel Process. Lett..

[10]  Richard Laundy,et al.  Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study , 2009, INFORMS J. Comput..

[11]  Yuji Shinano,et al.  FiberSCIP - A Shared Memory Parallelization of SCIP , 2018, INFORMS J. Comput..

[12]  Thorsten Koch,et al.  Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80,000 Cores , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[13]  Thorsten Koch,et al.  Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[14]  Andrea Lodi,et al.  Performance Variability in Mixed-Integer Programming , 2013 .

[15]  Tobias Achterberg,et al.  Mixed Integer Programming: Analyzing 12 Years of Progress , 2013 .

[16]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .