A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting

In this paper, we study the polyhedral structure of the set of 0-1 integer solutions to a single knapsack constraint and multiple disjoint cardinality constraints (MCKP). This set is a generalization of the classical 0-1 knapsack polytope (KP) and the 0-1 knapsack polytope with generalized upper bounds (GUBKP). For MCKP, we extend the traditional concept of a cover to that of a generalized cover. We then introduce generalized cover inequalities and present a polynomial algorithm that can lift them into facet-defining inequalities of the convex hull of MCKP. For the case where the knapsack coefficients are non-negative, we derive strong bounds on the lifting coefficients and describe the maximal set of generalized cover inequalities. Finally, we show that the bound estimates we obtained strengthen or generalize the known results for KP and GUBKP.

[1]  Z. Gu,et al.  Lifted cover inequalities for 0-1 and mixed 0-1 integer programs , 1995 .

[2]  Manfred W. Padberg.  (1,k)-configurations and facets for packing problems , 1980, Math. Program..

[3]  Prabhakant Sinha,et al.  The Multiple-Choice Knapsack Problem , 1979, Oper. Res..

[4]  C. E. Ferreira,et al.  Solving Multiple Knapsack Problems by Cutting Planes , 1996, SIAM J. Optim..

[5]  Ronald D. Armstrong,et al.  A computational study of a multiple-choice knapsack algorithm , 1983, TOMS.

[6]  Eitan Zemel,et al.  Lifting the facets of zero–one polytopes , 1978, Math. Program..

[7]  Fred W. Glover,et al.  Second-order cover inequalities , 2008, Math. Program..

[8]  Francesco Maffioli,et al.  An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints , 2006, Discret. Appl. Math..

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

[10]  Tsan-sheng Hsu,et al.  Scheduling Problems in a Practical Allocation Model , 1997, J. Comb. Optim..

[11]  Jean-Philippe P. Richard,et al.  A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting , 2011, Discret. Optim..

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

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

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

[15]  Robert Weismantel,et al.  On the 0/1 knapsack polytope , 1997, Math. Program..

[16]  Eitan Zemel,et al.  Easily Computable Facets of the Knapsack Polytope , 1989, Math. Oper. Res..

[17]  Ellis L. Johnson,et al.  A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..

[18]  Fred W. Glover,et al.  Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities , 2008, Discret. Optim..

[19]  Reha Uzsoy,et al.  A capacity allocation problem with integer side constraints , 1998, Eur. J. Oper. Res..

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

[21]  Hanif D. Sherali,et al.  Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes , 1995, SIAM J. Discret. Math..

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

[23]  George L. Nemhauser,et al.  Lifted cover facets of the 0-1 knapsack polytope with GUB constraints , 1994, Oper. Res. Lett..

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

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

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