The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests-Reference-Cited by-同舟云学术

The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests

Published:2001 Issue: Volume: Page:32-59
ISSN:0302-9743
Container-title:Algorithm Engineering and Experimentation
language:
Short-container-title:

Author:

Cirasella Jill,Johnson David S.,McGeoch Lyle A.,Zhang Weixiong

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44808-X_3

Reference32 articles.

1. D. Applegate, R. Bixby, V. Chvatal, and W. Cook. On the solution of traveling salesman problems. Doc. Mathemat-ica J. der Deutschen Mathematiker-Vereinigung, ICM III:645–656, 1998. The Concorde code is available from the website http://www.keck.caam.rice.edu/concorde.html

2. D. Applegate, W. Cook, and A. Rohe. Chained Lin-Kernighan for large traveling salesman problems. To appear. A postscript draft is currently available from the website http://www.caam.rice.edu/~bico/

3. G. Carpaneto, M. Dell’Amico, and P. Toth. Exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans. Mathematical Software, 21(4):394–409, 1995.

4. G. Carpaneto and P. Toth. Some new branching and bounding criteria for the asymmetric traveling salesman problem. Management Science, 26:736–743, 1980.

5. A. M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12:23–39, 1982.

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Geometric reasoning on the euclidean traveling salesperson problem in answer set programming1;Intelligenza Artificiale;2024-07-31

2. Analysis of Evolutionary Diversity Optimization for Permutation Problems;ACM Transactions on Evolutionary Learning and Optimization;2022-09-30

3. Heuristics for a cash-collection routing problem with a cluster-first route-second approach;Annals of Operations Research;2022-08-30

4. Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem;International Transactions in Operational Research;2021-08-03

5. Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints;Computation;2019-03-06