Could we use a million cores to solve an integer program?

Given the steady increase in cores per CPU, it is only a matter of time before supercomputers will have a million or more cores. In this article, we investigate the opportunities and challenges that will arise when trying to utilize this vast computing power to solve a single integer linear optimization problem. We also raise the question of whether best practices in sequential solution of ILPs will be effective in massively parallel environments.

[1]  William J. Cook,et al.  An Exact Rational Mixed-Integer Programming Solver , 2011, IPCO.

[2]  Roland Wunderling,et al.  Paralleler und objektorientierter Simplex-Algorithmus , 1996 .

[3]  Gabriel Wittum,et al.  Competence in High Performance Computing 2010 , 2012, Springer Berlin Heidelberg.

[4]  Gérard Cornuéjols,et al.  Early Estimates of the Size of Branch-and-Bound Trees , 2006, INFORMS J. Comput..

[5]  Eduardo Pinheiro,et al.  DRAM errors in the wild: a large-scale field study , 2009, SIGMETRICS '09.

[6]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

[7]  G. Nemhauser,et al.  Integer Programming , 2020 .

[8]  Ralf Borndörfer,et al.  A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit , 2008 .

[9]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[10]  Robert Klein,et al.  Operations Research Proceedings 2008 , 2009 .

[11]  Nimrod Megiddo,et al.  On Finding Primal- and Dual-Optimal Bases , 1991, INFORMS J. Comput..

[12]  Laurence A. Wolsey,et al.  Non-standard approaches to integer programming , 2002, Discret. Appl. Math..

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

[14]  Robert E. Bixby,et al.  Recovering an optimal LP basis from an interior point solution , 1994, Oper. Res. Lett..

[15]  Cynthia A. Phillips,et al.  Massively Parallel Mixed-Integer Programming: Algorithms and Applications , 2006, Parallel Processing for Scientific Computing.

[16]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

[17]  François Margot,et al.  Symmetry in Integer Linear Programming , 2010, 50 Years of Integer Programming.

[18]  Gerhard Reinelt,et al.  A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[19]  Ted K. Ralphs,et al.  On the Complexity of Selecting Disjunctions in Integer Programming , 2010, SIAM J. Optim..

[20]  Makoto Yamashita,et al.  Efficient parallel software for large-scale Semidefinite Programs , 2010, 2010 IEEE International Symposium on Computer-Aided Control System Design.

[21]  Eduardo Pinheiro,et al.  Failure Trends in a Large Disk Drive Population , 2007, FAST.

[22]  J. A. Julian Hall,et al.  Towards a practical parallelisation of the simplex method , 2010, Comput. Manag. Sci..

[23]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[24]  David F. Shanno,et al.  An exact primal–dual penalty method approach to warmstarting interior-point methods for linear programming , 2007, Comput. Optim. Appl..

[25]  Padma Raghavan,et al.  Parallel Processing for Scientific Computing , 2006, Software, Environments, Tools.

[26]  A. Mahajan,et al.  Experiments with Branching using General Disjunctions , 2009 .

[27]  Andrew J. Schaefer,et al.  Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs , 2011, INFORMS J. Comput..

[28]  M. Jünger,et al.  50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art , 2010 .

[29]  Vipin Kumar,et al.  A scalable parallel algorithm for sparse Cholesky factorization , 1994, Proceedings of Supercomputing '94.

[30]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[31]  M. Pfetsch,et al.  Detecting Orbitopal Symmetries , 2009 .

[32]  Diego Klabjan,et al.  A parallel primal-dual simplex algorithm , 2000, Oper. Res. Lett..

[33]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[34]  E. Alper Yildirim,et al.  Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension , 2008, Comput. Optim. Appl..

[35]  Masakazu Kojima,et al.  SDPARA: SemiDefinite Programming Algorithm paRAllel version , 2003, Parallel Comput..

[36]  Sally A. McKee,et al.  Hitting the memory wall: implications of the obvious , 1995, CARN.

[37]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

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

[39]  Marek Olszewski,et al.  Kendo: efficient deterministic multithreading in software , 2009, ASPLOS.

[40]  Jacek Gondzio,et al.  Warm start of the primal-dual method applied in the cutting-plane scheme , 1998, Math. Program..

[41]  Etienne de Klerk,et al.  Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster , 2010, Optim. Methods Softw..

[42]  Vipin Kumar,et al.  Parallel depth first search. Part II. Analysis , 1987, International Journal of Parallel Programming.

[43]  Matthew J. Saltzman,et al.  Computational Experience with a Software Framework for Parallel Integer Programming , 2009, INFORMS J. Comput..

[44]  Olaf Schenk,et al.  An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations , 2010, SIAM J. Sci. Comput..

[45]  Timo Berthold,et al.  Hybrid Branching , 2009, CPAIOR.

[46]  Alexander Martin,et al.  Parallelizing the Dual Simplex Method , 2000, INFORMS J. Comput..

[47]  Stephen J. Wright,et al.  Warm-Start Strategies in Interior-Point Methods for Linear Programming , 2002, SIAM J. Optim..

[48]  Stephen J. Wright,et al.  pPCx: Parallel Software for Linear Programming , 1997, PPSC.

[49]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[50]  Christoph Helmberg,et al.  A spectral bundle method with bounds , 2002, Math. Program..

[51]  Marco E. Lübbecke,et al.  Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs , 2010, SEA.

[52]  David Shallcross,et al.  An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming , 1993, INFORMS J. Comput..