The following pages link to Variable Neighborhood Search (Q4452895):
Displayed 6 items.
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- A new variable neighborhood search approach for solving dynamic memory allocation problem (Q4987788) (← links)
- A relax‐and‐price heuristic for the inventory‐location‐routing problem (Q5246829) (← links)
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS (Q5708845) (← links)
- VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE (Q5850790) (← links)
- Efficient algorithms for cluster editing (Q5963626) (← links)