CDT

Algorithm 750: CDT: A subroutine for the exact solution of large scale, asymmetric traveling salesman problems: The Fortran code CDT, implementing an algorithm for the asymmetric traveling 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. (Source: http://dl.acm.org/)

This software is also peer reviewed by journal TOMS.


References in zbMATH (referenced in 11 articles , 1 standard article )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Albareda-Sambola, Maria; Fernández, Elena; Nickel, Stefan: Multiperiod location-routing with decoupled time scales (2012)
  2. Albiach, José; Sanchis, José María; Soler, David: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (2008)
  3. Boujelben, Yassine; Girard, André; Grégoire, Jean-Charles: A sequential algorithm for constructing delay-constrained multirings for multipoint-to-Multipoint communications (2006)
  4. Albareda-Sambola, Maria; Díaz, Juan A.; Fernández, Elena: A compact model and tight bounds for a combined location-routing problem (2005)
  5. Blais, M.; Laporte, G.: Exact solution of the generalized routing problem through graph transformations (2003)
  6. Choi, In-Chan; Kim, Seong-In; Kim, Hak-Soo: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (2003)
  7. Fischetti, Matteo; Lodi, Andrea; Toth, Paolo: Solving real-world ATSP instances by branch-and-cut (2003)
  8. Xu, Zong-Ben; Jin, Hui-Dong; Leung, Kwong-Sak; Leung, Yee; Wong, Chak-Kuen: An automata network for performing combinatorial optimization (2002)
  9. Toth, Paolo: Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (2000)
  10. Carpaneto, G.; Dell’Amico, M.; Toth, P.: Algorithm 750: CDT: A subroutine for the exact solution of large scale, asymmetric traveling salesman problems (1995)
  11. Carpaneto, G.; Dell’Amico, M.; Toth, P.: Exact solution of large-scale, asymmetric traveling salesman problems (1995)