Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: G. Carpaneto Univ. di Modena, Modena, Italy
M. Dell'Amico Politecnico di Milano, Milan, Italy
P. Toth Univ. di Bologna, Bologna, Italy
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 21 Issue 4, Dec. 1995
Pages 410-415
ACM New York, NY, USA
table of contents doi>10.1145/212066.212084
Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 22
· Downloads (cumulative): 513
· Citation Count: 4


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder