Pages that link to "Item:Q1362516"
From MaRDI portal
The following pages link to Fast local search and guided local search and their application to British Telecom's workforce scheduling problem (Q1362516):
Displayed 14 items.
- Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
- Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
- Staff scheduling and rostering: a review of applications, methods and models. (Q1417478) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results (Q2490509) (← links)
- Fast and high precision algorithms for optimization in large-scale genomic problems (Q2490543) (← links)
- France Telecom workforce scheduling problem: a challenge (Q3644813) (← links)
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications (Q3644814) (← links)