Pages that link to "Item:Q1919776"
From MaRDI portal
The following pages link to Divide and conquer strategies for parallel TSP heuristics (Q1919776):
Displaying 6 items.
- The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP (Q1112565) (← links)
- Solving large batches of traveling salesman problems with parallel and distributed computing (Q1652354) (← links)
- (Q4251300) (← links)
- The parallel complexity of TSP heuristics (Q4729351) (← links)
- Global strategies for augmenting the efficiency of TSP heuristics (Q5060118) (← links)
- Learn global and optimize local: a data-driven methodology for last-mile routing (Q6047849) (← links)