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):
Displayed 13 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)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← 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)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)