Pages that link to "Item:Q1652289"
From MaRDI portal
The following pages link to A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289):
Displaying 12 items.
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- A decomposition-based algorithm for the double row layout problem (Q1988733) (← links)
- On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
- DILS: constrained clustering through dual iterative local search (Q2664309) (← links)
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem (Q2669499) (← links)
- A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) (Q5059314) (← links)
- Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers (Q6114711) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
