Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
Computers and Operations Research
Solving real-world ATSP instances by branch-and-cut
Combinatorial optimization - Eureka, you shrink!
A compact model and tight bounds for a combined location-routing problem
Computers and Operations Research
| Hi-index | 0.00 |
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.