The following pages link to (Q3820397):
Displaying 4 items.
- The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP (Q1112565) (← links)
- New parallel randomized algorithms for the traveling salesman problem (Q1302601) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- The parallel complexity of TSP heuristics (Q4729351) (← links)