Pages that link to "Item:Q1785756"
From MaRDI portal
The following pages link to A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756):
Displaying 9 items.
- 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)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the \(0/1\) knapsack polytope (Q1373759) (← links)
- A polyhedral study of the cardinality constrained knapsack problem (Q1404231) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)