Pages that link to "Item:Q5059432"
From MaRDI portal
The following pages link to A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX<sup>®</sup> (Q5059432):
Displaying 3 items.
- Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners (Q6080629) (← links)
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)
