The traveling salesman problem: An update of research

DOI10.1002/nav.3800300107zbMath0521.90100OpenAlexW2050155999MaRDI QIDQ3671783

No author found.

Publication date: 1983

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800300107

zbMATH Keywords

surveycombinatorial optimizationgraphstraveling salesman problemexact algorithmssubtour eliminationcomputational testingcutting plane approachesminimum weight Hamiltonian cyclenonexact procedurestree formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Two-edge connected spanning subgraphs and polyhedra, On perfectly two-edge connected graphs, On the resources allocation problem, \(k\)-interchange heuristic as an optimization procedure for material handling applications, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Traveling salesman problem under categorization, Shuffling heuristics for the storage location assignment in an AS/RS, Minimum-weight two-connected spanning networks, Emergency relief routing models for injured victims considering equity and priority, Guaranteed performance heuristics for the bottleneck traveling salesman problem, A multi-objective humanitarian pickup and delivery vehicle routing problem with drones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
• Integer Programming Formulation of Traveling Salesman Problems
• A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• P-Complete Approximation Problems
• Computer Solutions of the Traveling Salesman Problem
• Systematic generation of Hamiltonian circuits
• Maximum matching and a polyhedron with 0,1-vertices
• A man-machine approach toward solving the traveling salesman problem