Pages that link to "Item:Q2467571"
From MaRDI portal
The following pages link to A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571):
Displayed 8 items.
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions (Q3557805) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)