The following pages link to (Q3677509):
Displaying 9 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Parallelization strategies for rollout algorithms (Q812417) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Special cases of traveling salesman and repairman problems with time windows (Q3993633) (← links)
