Divide and conquer strategies for parallel TSP heuristics

DOI10.1016/0305-0548(95)00066-6zbMath0854.90137MaRDI QIDQ1919776

Giovanni Cesari

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

zbMATH Keywords

parallel heuristics; divide und conquer strategies; geometric traveling salesman problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65Y05: Parallel numerical computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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