Transforming asymmetric into symmetric traveling salesman problems

Authors:
Roy Jonker;Ton Volgenant
Affiliations:
Faculty of Actuarial Science and Econometrics, University of Amsterdam, the Netherlands;Faculty of Actuarial Science and Econometrics, University of Amsterdam, the Netherlands
Venue:
Operations Research Letters
Year:
1983

Citing 0
Cited 8

Cut-and-solve: An iterative search strategy for combinatorial optimization problems

Artificial Intelligence
The effect of the asymmetry of road transportation networks on the traveling salesman problem

Computers and Operations Research
Transforming asymmetric into symmetric traveling salesman problems: erratum

Operations Research Letters
Improved filtering for weighted circuit constraints

Constraints
Are Stacker Crane Problems easy? A statistical study

Computers and Operations Research
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem

Discrete Applied Mathematics
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

Computers and Operations Research
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe how to transform an asymmetric traveling salesman problem into a symmetric one at the cost of almost doubled problem size. Use and consequences are discussed shortly.