Transforming asymmetric into symmetric traveling salesman problems

DOI10.1016/0167-6377(83)90048-2MaRDI QIDQ787877zbMATH OpenOpenAlexWikidataFDO

Authors 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

asymmetric traveling salesman problemsymmetric equivalent problemtransformation

Mathematics Subject Classification ID

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

Cites work

• A restricted Lagrangean approach to the traveling salesman problem
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• The traveling salesman problem: A duality approach
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(19)

• Transforming asymmetric into symmetric traveling salesman problems: Erratum
• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
• On the generalized 2-peripatetic salesman problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Efficient filtering for the resource-cost alldifferent constraint
• The effect of the asymmetry of road transportation networks on the traveling salesman problem
• From symmetry to asymmetry: generalizing TSP approximations by parametrization
• 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
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• Solution of real-world postman problems
• 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
• An ILP-refined tabu search for the directed profitable rural postman problem
• A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
• Improved filtering for weighted circuit constraints
• From symmetry to asymmetry: generalizing TSP approximations by parametrization
• On the integrality gap of small asymmetric traveling salesman problems: a polyhedral and computational approach
• Solving the asymmetric traveling purchaser problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787877)