The FORTRAN code CDT, implementing the algorithm of Carpaneto, Dell'Amico and Toth 1995afor the Asymmetric Travelling Salesman Problem, is presented. The method is based on the Assignment Problem relaxation and on a subtour elimination branching scheme. The effectiveness of the implementation derives from reduction procedures and parametric solution of the relaxed problems associated with the nodes of the branch-decision tree.
Algorithm 750: CDT A Subroutinefor the Exact Solution ofLarge-Scale, Asymmetric Traveling Salesman Problems / G., Carpaneto; Dell'Amico, Mauro; P., Toth. - In: ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE. - ISSN 0098-3500. - STAMPA. - 21:(1995), pp. 410-415.
Algorithm 750: CDT A Subroutinefor the Exact Solution ofLarge-Scale, Asymmetric Traveling Salesman Problems
DELL'AMICO, Mauro;
1995
Abstract
The FORTRAN code CDT, implementing the algorithm of Carpaneto, Dell'Amico and Toth 1995afor the Asymmetric Travelling Salesman Problem, is presented. The method is based on the Assignment Problem relaxation and on a subtour elimination branching scheme. The effectiveness of the implementation derives from reduction procedures and parametric solution of the relaxed problems associated with the nodes of the branch-decision tree.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
