Lifting two-integer knapsack inequalities

In this paper we discuss the derivation of strong valid inequalities for (mixed) integer knapsack sets based on lifting of valid inequalities for basic knapsack sets with two integer variables (and one continuous variable). The basic polyhedra can be described in polynomial time. We use superadditive valid lifting functions in order to obtain sequence independent lifting. Most of these superadditive functions and valid inequalities are not obtained in polynomial time.

[1]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[2]  Miguel Fragoso Constantino,et al.  Description of 2-integer continuous knapsack polyhedra , 2006, Discret. Optim..

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

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

[5]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

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

[7]  Robert Weismantel,et al.  Hilbert Bases and the Facets of Special Knapsack Polytopes , 1996, Math. Oper. Res..

[8]  Laurence A. Wolsey,et al.  Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation , 1995, Discret. Appl. Math..

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

[10]  Laurence A. Wolsey,et al.  Lifting, superadditivity, mixed integer rounding and single node flow sets revisited , 2003, 4OR.

[11]  Chak-Kuen Wong,et al.  A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables , 1976, JACM.

[12]  Alper Atamtürk,et al.  Designing capacitated survivable networks: polyhedral analysis and algorithms , 2004 .

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

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

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

[16]  A. Atamtūrk,et al.  Sequence Independent Lifting for Mixed-Integer Programming , 2004 .

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

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

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