The following pages link to (Q3138882):
Displaying 14 items.
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Parallelization strategies for rollout algorithms (Q812417) (← links)
- An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep (Q1384210) (← links)
- A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
- The Euclidean traveling salesman problem and a space-filling curve (Q1392940) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
- The multiagent planning problem (Q2012788) (← links)
- Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758) (← links)
- Single vehicle routing with a predefined customer sequence and multiple depot returns (Q2463499) (← links)
- An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs (Q2566929) (← links)
- Global strategies for augmenting the efficiency of TSP heuristics (Q5060118) (← links)
