The following pages link to (Q4251300):
Displaying 8 items.
- The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP (Q1112565) (← links)
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem (Q1282966) (← links)
- New parallel randomized algorithms for the traveling salesman problem (Q1302601) (← links)
- Solving large batches of traveling salesman problems with parallel and distributed computing (Q1652354) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- Analysis of a High-Performance TSP Solver on the GPU (Q4577952) (← links)
- The parallel complexity of TSP heuristics (Q4729351) (← links)
- A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM (Q5217228) (← links)