ALGORITHM-750 - CDT - A SUBROUTINE FOR THE EXACT SOLUTION OF LARGE-SCALE, ASYMMETRIC TRAVELING SALESMAN PROBLEMS

Authors
CARPANETO G DELLAMICO M TOTH P
Citation
G. Carpaneto et al., ALGORITHM-750 - CDT - A SUBROUTINE FOR THE EXACT SOLUTION OF LARGE-SCALE, ASYMMETRIC TRAVELING SALESMAN PROBLEMS, ACM transactions on mathematical software, 21(4), 1995, pp. 410-415
Citations number
4
Categorie Soggetti
Computer Sciences",Mathematics
Journal title
ACM transactions on mathematical software → ACNP
ISSN journal
00983500
Volume
21
Issue
4
Year of publication
1995
Pages
410 - 415
Database
ISI
SICI code
0098-3500(1995)21:4<410:A-C-AS>2.0.ZU;2-N
Abstract
The Fortran code CDT, implementing an algorithm for the asymmetric tra veling salesman problem, is presented. The method is based on the Assi gnment Problem relaxation and on a subtour elimination branching schem e. The effectiveness of the implementation derives from reduction proc edures and parametric solution of the relaxed problems associated with the nodes of the branch-decision tree.