Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

Abstract.In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer rounding with lifting for the development of strong valid inequalities for knapsack and single node flow sets. Our hope is that the latter can be used in practice to generate cutting planes for mixed integer programs. The survey contains essentially two parts. In the first we present lifting in a very general way, emphasizing superadditive lifting which allows one to lift simultaneously different sets of variables. In the second, our procedure for generating strong valid inequalities consists of reduction to a knapsack set with a single continuous variable, construction of a mixed integer rounding inequality, and superadditive lifting. It is applied to several generalizations of the 0-1 single node flow set.

[1]  Laurence A. Wolsey,et al.  Valid Inequalities and Superadditivity for 0-1 Integer Programs , 1977, Math. Oper. Res..

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

[3]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[4]  Martin W. P. Savelsbergh,et al.  Sequence Independent Lifting in Mixed Integer Programming , 2000, J. Comb. Optim..

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

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

[7]  Martin W. P. Savelsbergh,et al.  Valid inequalities for problems with additive variable upper bounds , 1999, Math. Program..

[8]  M. Oosten,et al.  A polyhedral approach to grouping problems , 1996 .

[9]  Ellis L. Johnson.  Cyclic Groups, Cutting Planes, Shortest Paths , 1973 .

[10]  Jan Stallaert.  The Complementary Class of Generalized Flow Cover Inequalities , 1997, Discret. Appl. Math..

[11]  M. Goemans.  Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds , 1989 .

[12]  George L. Nemhauser,et al.  Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting , 2003, Math. Program..

[13]  Alper Atamtürk,et al.  Flow pack facets of the single node fixed-charge flow polytope , 2001, Oper. Res. Lett..

[14]  Alper Atamtürk,et al.  A study of the lot-sizing polytope , 2004, Math. Program..

[15]  Martin W. P. Savelsbergh,et al.  On the polyhedral structure of a multi–item production planning model with setup times , 2003, Math. Program..

[16]  Laurence A. Wolsey,et al.  Cutting planes for integer programs with general integer variables , 1998, Math. Program..

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

[18]  Laurence A. Wolsey,et al.  Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints , 1990, Discret. Appl. Math..

[19]  Laurence A. Wolsey,et al.  Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..

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

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

[22]  Martin W. P. Savelsbergh,et al.  A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case , 2003, Math. Program..

[23]  Laurence A. Wolsey,et al.  The 0-1 Knapsack problem with a single continuous variable , 1999, Math. Program..

[24]  Laurence A. Wolsey,et al.  Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..

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

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

[27]  Alper Atamtürk,et al.  On capacitated network design cut–set polyhedra , 2002, Math. Program..

[28]  George L. Nemhauser,et al.  Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms , 2002, Math. Program..

[29]  Laurence A. Wolsey,et al.  Submodularity and valid inequalities in capacitated fixed charge networks , 1989 .

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

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

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

[33]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

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

[35]  Robert G. Jeroslow,et al.  An Introduction to the Theory of Cutting-Planes , 1979 .

[36]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..