Pages that link to "Item:Q2670441"
From MaRDI portal
The following pages link to Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441):
Displaying 4 items.
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- Knapsack: connectedness, path, and shortest-path (Q6547953) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)