On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint

In this short note we obtain the full set of inequalities that define the convex hull of a 0–1 knapsack constraint presented in Weismantel (1997). For that purpose we use our O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, as well as our schemes for coefficient increase based tightening cover induced inequalities and coefficient reduction based tightening general 0–1 knapsack constraints.

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

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

[3]  Michael S. Waterman,et al.  COMPUTATION OF GENERATING FUNCTIONS FOR BIOLOGICAL MOLECULES , 1980 .

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

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

[6]  Laurence Wolsey,et al.  Strong formulations for mixed integer programming: A survey , 1989, Math. Program..

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

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

[9]  Brenda L Dietrich,et al.  O(n) Procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates , 1993 .

[10]  Laureano F. Escudero,et al.  Efficient Reformulation for 0-1 Programs - Methods and Computational Results , 1993, Discret. Appl. Math..

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

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

[13]  Laureano F. Escudero,et al.  On characterizing tighter formulations for 0-1 programs , 1998, Eur. J. Oper. Res..

[14]  Gloria Pérez,et al.  O(n log n) procedures for tightening cover inequalities , 1999, Eur. J. Oper. Res..