Pages that link to "Item:Q6094505"
From MaRDI portal
The following pages link to When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505):
Displaying 6 items.
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- 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) (← links)
- Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners (Q6080629) (← links)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)