Fast Heuristics for Large Geometric Traveling Salesman Problems

DOI10.1287/IJOC.4.2.206zbMath0759.90094OpenAlexW1967317811MaRDI QIDQ4030791

Gerhard Reinelt

Publication date: 1 April 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.4.2.206

zbMATH Keywords

heuristicstime restrictionsvery large scale traveling salesman problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (13)

Good triangulations yield good tours ⋮ TRAVELING SALESMAN PROBLEM OF SEGMENTS ⋮ Routing problems: A bibliography ⋮ Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ Divide and conquer strategies for parallel TSP heuristics ⋮ Evolutionary algorithms for solving multi-objective travelling salesman problem ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation ⋮ Provably good solutions for the traveling salesman problem ⋮ Vehicle routing with a sparse feasibility graph ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic ⋮ Implementation analysis of efficient heuristic algorithms for the traveling salesman problem ⋮ Genetic local search in combinatorial optimization

This page was built for publication: Fast Heuristics for Large Geometric Traveling Salesman Problems