Transforming asymmetric into symmetric traveling salesman problems: Erratum

DOI10.1016/0167-6377(86)90081-7zbMath0604.90132OpenAlexW1977346877MaRDI QIDQ1084026

Ton Volgenant, Roy Jonker

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90081-7

zbMATH Keywords

asymmetric traveling salesmansymmetric problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

From symmetry to asymmetry: generalizing TSP approximations by parametrization, An ILP-refined tabu search for the directed profitable rural postman problem, Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, From symmetry to asymmetry: generalizing TSP approximations by parametrization, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem

Cites Work

• Transforming asymmetric into symmetric traveling salesman problems