Pages that link to "Item:Q429688"
From MaRDI portal
The following pages link to A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688):
Displaying 11 items.
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- Knapsack polytopes: a survey (Q827125) (← 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)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)