Logical Processing for Integer Programming

This paper reviews tools which have great potential for reducing the difficulty of solving IP (and also MIP) problems, if well implemented in solvers. Recent experiments with Branch and Bound solvers, in connection with “Short Start Features”, have shown that implementations need and can still be improved. Concepts which are likely to be specially important for (0,1) MIP are pointed out.

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

[2]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[3]  Peter L. Hammer,et al.  On the Role of Generalized Covering Problems. , 1972 .

[4]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[5]  Kurt Spielberg,et al.  Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..

[6]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[7]  GAPRobert E. BixbyILOG.  MIP : THEORY AND PRACTICE { CLOSING THE , 2000 .

[8]  Fred W. Glover.  A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg , 1971, Oper. Res..

[9]  Eric Gelman,et al.  Recent Advances in Crew-Pairing Optimization at American Airlines , 1991 .

[10]  Manfred W. Padberg,et al.  Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..

[11]  S. Zionts.  Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables , 1972 .

[12]  Laureano F. Escudero,et al.  On tightening cover induced inequalities , 1992 .

[13]  R. Lougee-Heimer,et al.  A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs , 2005, Ann. Oper. Res..

[14]  Fred Glover,et al.  Flows in Arborescences , 1971 .

[15]  Paolo Toth,et al.  A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems , 1995, IPCO.

[16]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[17]  Monique Guignard-Spielberg,et al.  Search techniques with adaptive features for certain integer and mixed integer programming problems , 1968, IFIP Congress.

[18]  Monique Guignard-Spielberg,et al.  Model tightening for integrated timber harvest and transportation planning , 1998, Eur. J. Oper. Res..

[19]  K. Spielberg,et al.  On a Production Allocation and Distribution Problem , 1978 .

[20]  John D. C. Little,et al.  On model building , 1993 .

[21]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[22]  Michael M. Kostreva,et al.  Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models , 1985, Oper. Res..

[23]  Ellis L. Johnson,et al.  A Global Approach to Crew-Pairing Optimization , 1992, IBM Syst. J..

[24]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

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

[26]  Donald G. Morrison,et al.  Critique of: “Ranking Procedures and Subjective Probability Distributions” , 1967 .

[27]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[28]  R. Lougee-Heimer.  A Note on Coefficient Adjustment Using Sos Constraints , 2001, Oper. Res..

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

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

[31]  M. Balinski.  Fixed‐cost transportation problems , 1961 .

[32]  Ellis L. Johnson,et al.  Airline Crew Scheduling: State-of-the-Art , 2005, Ann. Oper. Res..

[33]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[34]  M. Guignard,et al.  Applying a modified coefficient reduction method to a dynamic production scheduling model , 1992 .

[35]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[36]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[37]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

[38]  H. P. Williams.  Experiments in the formulation of integer programming problems , 1974 .

[39]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[40]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[41]  J. Rubin.  A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .