Divide and conquer strategies for parallel TSP heuristics
From MaRDI portal
Publication:1919776
DOI10.1016/0305-0548(95)00066-6zbMath0854.90137OpenAlexW1978177608MaRDI QIDQ1919776
Publication date: 24 July 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(95)00066-6
Related Items (2)
Solving large batches of traveling salesman problems with parallel and distributed computing ⋮ Learn global and optimize local: a data-driven methodology for last-mile routing
Cites Work
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- The traveling salesman problem: An overview of exact and approximate algorithms
- A parallel tabu search algorithm for large traveling salesman problems
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- Fast Algorithms for Geometric Traveling Salesman Problems
- Fast Heuristics for Large Geometric Traveling Salesman Problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- The parallel complexity of TSP heuristics
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Divide and conquer strategies for parallel TSP heuristics
