Lifting the facets of zero–one polytopes
From MaRDI portal
Publication:3865839
DOI10.1007/BF01609032zbMath0428.90042MaRDI QIDQ3865839
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Knapsack polytopes: a survey, The project scheduling polyhedron: Dimension, facets and lifting theorems, A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope, Facets of the knapsack polytope derived from disjoint and overlapping index configurations, Theoretical challenges towards cutting-plane selection, On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\), The Boolean quadratic polytope: Some characteristics, facets and relatives, On the facial structure of the set covering polytope, Facets and lifting procedures for the set covering polytope, On the facets of stable set polytopes of circular interval graphs, Sequence independent lifting of cover inequalities, Sequence independent lifting for mixed knapsack problems with GUB constraints, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting, On the facets of the stable set polytope of quasi-line graphs, The generalized assignment problem: Valid inequalities and facets, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, Generalized cover facet inequalities for the generalized assignment problem, Approximate and exact merging of knapsack constraints with cover inequalities, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, On the mixed set covering, packing and partitioning polytope, On tightening cover induced inequalities, The complexity of lifted inequalities for the knapsack problem, On the exact separation of mixed integer knapsack cuts, Polyhedral properties of the induced cluster subgraphs, On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\), Aggregation-based cutting-planes for packing and covering integer programs, Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1, Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope, The aggregation closure is polyhedral for packing and covering integer programs, Some facets of the simple plant location polytope, Cover and pack inequalities for (mixed) integer programming
Cites Work
- Unnamed Item
- A class of facet producing graphs for vertex packing polyhedra
- Disjunctive programming: Properties of the convex hull of feasible points
- Technical Note—A Note on Zero-One Programming
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Facets of the Knapsack Polytope From Minimal Covers
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- Canonical Cuts on the Unit Hypercube
- Blocking and anti-blocking pairs of polyhedra
