On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
From MaRDI portal
Publication:1304779
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)
Related Items
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