Transforming asymmetric into symmetric traveling salesman problems

DOI10.1016/0167-6377(83)90048-2zbMath0529.90090OpenAlexW2095454340WikidataQ56067392 ScholiaQ56067392MaRDI QIDQ787877

Roy Jonker, Ton Volgenant

Publication date: 1983

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(83)90048-2

zbMATH Keywords

transformationasymmetric traveling salesman problemsymmetric equivalent problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items (18)

On the generalized 2-peripatetic salesman problem ⋮ Transforming asymmetric into symmetric traveling salesman problems: Erratum ⋮ From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics ⋮ The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Solving the asymmetric traveling purchaser problem ⋮ Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem ⋮ An ILP-refined tabu search for the directed profitable rural postman problem ⋮ A data-guided lexisearch algorithm for the asymmetric traveling salesman problem ⋮ Efficient filtering for the resource-cost alldifferent constraint ⋮ Cut-and-solve: An iterative search strategy for combinatorial optimization problems ⋮ Improved filtering for weighted circuit constraints ⋮ Generalization of machine learning for problem reduction: a case study on travelling salesman problems ⋮ Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand ⋮ Solution of real-world postman problems ⋮ The effect of the asymmetry of road transportation networks on the traveling salesman problem ⋮ From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic

Cites Work

• Unnamed Item
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• A restricted Lagrangean approach to the traveling salesman problem
• The traveling salesman problem: A duality approach
• Computer Solutions of the Traveling Salesman Problem
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: Transforming asymmetric into symmetric traveling salesman problems