Pages that link to "Item:Q1890949"
From MaRDI portal
The following pages link to Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949):
Displaying 34 items.
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← 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)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations (Q1103523) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- On facets of knapsack equality polytopes (Q1367796) (← links)
- On the \(0/1\) knapsack polytope (Q1373759) (← links)
- Zero-lifting for integer block structured problems (Q1402536) (← links)
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (Q1424281) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- Lifting valid inequalities for the precedence constrained knapsack problem (Q1806031) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- Facets of the Complementarity Knapsack Polytope (Q5704071) (← links)
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators (Q6561224) (← links)
