Exact solution of large-scale, asymmetri
โ
Carpaneto, G.; Dell'Amico, M.; Toth, P.
๐
Article
๐
1995
๐
Association for Computing Machinery
๐
English
โ 995 KB
A lowest-first, branch-and-bound 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 algorithm derives from reduction procedures and paramet