\(O(n \log n)\) procedures for tightening cover inequalities
From MaRDI portal
Publication:1124826
DOI10.1016/S0377-2217(98)00100-3zbMath0941.90056OpenAlexW2012987521MaRDI QIDQ1124826
Laureano Fernando Escudero Bueno, María Araceli Garín, Gloria Pérez
Publication date: 28 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00100-3
Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Related Items
An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. ⋮ On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
Cites Work
- Unnamed Item
- Strong formulations for mixed integer programming: A survey
- On tightening cover induced inequalities
- On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function
- 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
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Easily Computable Facets of the Knapsack Polytope
- Solving Large-Scale Zero-One Linear Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Technical Note—A Note on Zero-One Programming
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Facets of the Knapsack Polytope From Minimal Covers
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Properties of vertex packing and independence system polyhedra
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
- Sequence independent lifting of cover inequalities
- On the facial structure of set packing polyhedra
