Pages that link to "Item:Q2506174"
From MaRDI portal
The following pages link to A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174):
Displayed 11 items.
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights (Q965587) (← links)
- A column generation method for the multiple-choice multi-dimensional knapsack problem (Q969718) (← 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)
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
- Coordinated road-network search route planning by a team of UAVs (Q5410832) (← links)