Pages that link to "Item:Q5024916"
From MaRDI portal
The following pages link to A Fast Algorithm for Knapsack Problem with Conflict Graph (Q5024916):
Displaying 3 items.
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)