Pages that link to "Item:Q2489302"
From MaRDI portal
The following pages link to Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302):
Displaying 11 items.
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- An application of the multiple knapsack problem: the self-sufficient marine (Q1752270) (← links)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines (Q1762138) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A tabu search approach for the livestock collection problem (Q2482370) (← 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)
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
- Exponential extrapolation memory for tabu search (Q6114931) (← links)
