Integer-Programming Software Systems

Recent developments in integer-programming software systems have tremendously improved our ability to solve large-scale instances. We review the major algorithmic components of state-of-the-art solvers and discuss the options available to users for adjusting the behavior of these solvers when default settings do not achieve the desired performance level. Furthermore, we highlight advances towards integrated modeling and solution environments. We conclude with a discussion of model characteristics and substructures that pose challenges for integer-programming software systems and a perspective on features we may expect to see in these systems in the near future.

[1]  Erling D. Andersen,et al.  Presolving in linear programming , 1995, Math. Program..

[2]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..

[3]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[4]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts , 2004, IPCO.

[5]  John J. H. Forrest,et al.  Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .

[6]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[7]  John N. Hooker,et al.  Optimization and , 2000 .

[8]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[9]  Arjen K. Lenstra,et al.  Hard Equality Constrained Integer Knapsacks , 2002, Math. Oper. Res..

[10]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[11]  François Margot,et al.  Exploiting orbits in symmetric ILP , 2003, Math. Program..

[12]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[13]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[14]  J. Gondzio,et al.  Presolove Analysis of Linear Programs Prior to Applying an Interior Point Method , 1997, INFORMS J. Comput..

[15]  Monique Guignard-Spielberg,et al.  Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables , 1981, Oper. Res..

[16]  Laurence A. Wolsey,et al.  Uncapacitated lot-sizing: The convex hull of solutions , 1984 .

[17]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[18]  Robert E. Bixby,et al.  Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.

[19]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[20]  Alper Atamtürk.  Strong Formulations of Robust Mixed 0–1 Programming , 2006, Math. Program..

[21]  Kenji Yoshino,et al.  Covering , 1912, The Indian medical gazette.

[22]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

[23]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[24]  Gautam Mitra.  Investigation of some branch and bound strategies for the solution of mixed integer linear programs , 1973, Math. Program..

[25]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[26]  Hanif D. Sherali,et al.  Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[27]  Sanjay Mehrotra,et al.  On the Value of Binary Expansions for General Mixed-Integer Linear Programs , 2002, Oper. Res..

[28]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[29]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[30]  Maarten H. van der Vlerk,et al.  Stochastic Integer Programming Bibliography , 2007 .

[31]  Daniel Bienstock,et al.  Computational Study of a Family of Mixed-Integer Quadratic Programming Problems , 1995, IPCO.

[32]  Laurence A. Wolsey,et al.  Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs , 2002, Math. Oper. Res..

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

[34]  George L. Nemhauser,et al.  A Polyhedral Study of the Cardinality Constrained Knapsack Problem , 2002, IPCO.

[35]  E.M.L. Beale,et al.  Branch and Bound Methods for Mathematical Programming Systems , 1977 .

[36]  Arjen K. Lenstra,et al.  Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables , 2000, Math. Oper. Res..

[37]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[38]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[39]  George L. Nemhauser,et al.  A polyhedral study of the cardinality constrained knapsack problem , 2002, Math. Program..

[40]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[41]  George L. Nemhauser,et al.  Branch-and-cut for combinatorial optimization problems without auxiliary binary variables , 2001, The Knowledge Engineering Review.

[42]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[43]  A. Land,et al.  Computer Codes for Problems of Integer Programming , 1979 .

[44]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

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

[46]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[47]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

[48]  Iiro Harjunkoski,et al.  Hybrid mixed-integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems , 2000 .

[49]  Martin W. P. Savelsbergh,et al.  Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..

[50]  Milind Dawande,et al.  A Class of Hard Small 0-1 Programs , 1998, INFORMS J. Comput..

[51]  E. Balas,et al.  Facets of the Knapsack Polytope From Minimal Covers , 1978 .

[52]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Computation , 1998, INFORMS J. Comput..

[53]  Alper Atamtürk,et al.  On the facets of the mixed–integer knapsack polyhedron , 2003, Math. Program..

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

[55]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..