Transforming asymmetric into symmetric traveling salesman problems: Erratum
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.
scientific article; zbMATH DE number 3976812