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

DOI10.1007/BF02564716zbMath0932.90026MaRDI QIDQ1304779

Gloria Pérez, María Araceli Garín, Laureano Fernando Escudero Bueno

Publication date: 22 September 1999

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

covermaximal cliquesknapsack constraint0-1 programcoefficient increasecoefficient reduction

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items

Alternative formulations for the set packing problem and their application to the winner determination problem

Cites Work

• Unnamed Item
• Strong formulations for mixed integer programming: A survey
• \(O(n \log n)\) procedures for tightening cover inequalities
• On tightening cover induced inequalities
• On the \(0/1\) knapsack polytope
• Efficient reformulation for 0-1 programs -- methods and computational results
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Facets of the Knapsack Polytope From Minimal Covers
• On the facial structure of set packing polyhedra