Transforming asymmetric into symmetric traveling salesman problems. (English) Zbl 0529.90090


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


Zbl 0366.68041
Full Text: DOI


[1] Balas, E.; Christofides, N., A restricted Lagrangean approach to the traveling salesman problem, Math. Programming, 21, 19-46 (1981) · Zbl 0461.90068
[2] Bazaraa, M. S.; Goode, J. J., The traveling salesman problem: A duality approach, Math. Programming, 13, 221-237 (1977) · Zbl 0377.90092
[3] Held, M.; Karp, R. M., The traveling-salesman problem and minimum spinning trees, Math. Programming, 1, 6-26 (1971) · Zbl 0232.90038
[4] Karp, R. M., Reducibility among combinatorial problems, (Miller, R. E.; Thatcher, J. W., Complexity of Computer Computations (1972)), New York · Zbl 0366.68041
[5] Lin, S., Computer solutions of the traveling salesman problem, Bell Syst. Techn. J., 44, 2245-2269 (1965) · Zbl 0136.14705
[6] Volgenant, A.; Jonker, R., The symmetric traveling salesman problem and edge exchanges in minimal 1-trees, European J. Oper. Res., 12, 394-403 (1983) · Zbl 0496.90079
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.