Pages that link to "Item:Q3865839"
From MaRDI portal
The following pages link to Lifting the facets of zero–one polytopes (Q3865839):
Displaying 32 items.
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations (Q1103523) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- The project scheduling polyhedron: Dimension, facets and lifting theorems (Q2367366) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Sequence independent lifting of cover inequalities (Q5101436) (← links)
- A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
