Pages that link to "Item:Q2890459"

The following pages link to A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459):

Displaying 18 items.

• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
• Alternating control tree search for knapsack/covering problems (Q972644) (← links)
• Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
• Discrete facility location and routing of obnoxious activities. (Q1417557) (← 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)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
• (Q2722077) (← links)
• (Q3500140) (← links)
• (Q4900928) (← 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^® (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)
• Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)