Parallel optimization for TSP
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1703862
- The parallel complexity of TSP heuristics
- Divide and conquer strategies for parallel TSP heuristics
- scientific article; zbMATH DE number 764414
- Parallel Tabu Search
- scientific article; zbMATH DE number 1150245
- scientific article; zbMATH DE number 4131978
- Optimization parallelizing for discrete programming problems
- scientific article; zbMATH DE number 4209478
Cited in
(15)- The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
- New parallel randomized algorithms for the traveling salesman problem
- Solving large batches of traveling salesman problems with parallel and distributed computing
- Divide and conquer strategies for parallel TSP heuristics
- scientific article; zbMATH DE number 1703862 (Why is no real title available?)
- scientific article; zbMATH DE number 4174699 (Why is no real title available?)
- Paralell evolution heuristic approach for the traveling salesman problem
- scientific article; zbMATH DE number 1225029 (Why is no real title available?)
- scientific article; zbMATH DE number 2078921 (Why is no real title available?)
- Analysis of a high-performance TSP solver on the GPU
- scientific article; zbMATH DE number 2158374 (Why is no real title available?)
- The parallel complexity of TSP heuristics
- scientific article; zbMATH DE number 815426 (Why is no real title available?)
- A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
This page was built for publication: Parallel optimization for TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251300)
