Lifting the facets of zero-one polytopes
From MaRDI portal
Cites work
- A class of facet producing graphs for vertex packing polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Canonical Cuts on the Unit Hypercube
- Convexity and optimization in finite dimensions
- Disjunctive programming: Properties of the convex hull of feasible points
- Faces for a linear inequality in O-1 variables
- Facet of regular O-1 polytopes
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- On the facial structure of set packing polyhedra
- Properties of vertex packing and independence system polyhedra
- Technical Note—A Note on Zero-One Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Cited in
(33)- Facets of the knapsack polytope derived from disjoint and overlapping index configurations
- 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 tightening cover induced inequalities
- The complexity of lifted inequalities for the knapsack problem
- Theoretical challenges towards cutting-plane selection
- On the mixed set covering, packing and partitioning polytope
- Aggregation-based cutting-planes for packing and covering integer programs
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Polyhedral properties of the induced cluster subgraphs
- The aggregation closure is polyhedral for packing and covering integer programs
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- On the facets of stable set polytopes of circular interval graphs
- Generalized cover facet inequalities for the generalized assignment problem
- Some facets of the simple plant location polytope
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- Sequence independent lifting of cover inequalities
- A noncompact formulation for job-shop scheduling problems in traffic management
- Approximate and exact merging of knapsack constraints with cover inequalities
- On the exact separation of mixed integer knapsack cuts
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the facets of the stable set polytope of quasi-line graphs
- Two-set inequalities for the binary knapsack polyhedra
- Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
- Cover and pack inequalities for (mixed) integer programming
- Knapsack polytopes: a survey
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- The generalized assignment problem: Valid inequalities and facets
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
This page was built for publication: Lifting the facets of zero-one polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3865839)