Transforming asymmetric into symmetric traveling salesman problems: Erratum (Q1084026)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transforming asymmetric into symmetric traveling salesman problems: Erratum |
scientific article |
Statements
Transforming asymmetric into symmetric traveling salesman problems: Erratum (English)
0 references
1986
0 references
Our previously presented transformation of partly asymmetric into symmetric traveling salesman problems [see ibid. 2, 161-163 (1983; Zbl 0529.90090)] is shown to be incorrect. It only yields a lower bound on the optimal cost. We also show that asymmetric traveling salesman problems on n nodes can be solved as symmetric problems on 2n-1 nodes.
0 references
asymmetric traveling salesman
0 references
symmetric problems
0 references