๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Exact Solution of Large Asymmetric Traveling Salesman Problems

โœ Scribed by MILLER, D. L.; PEKNY, J. F.

Book ID
121150263
Publisher
American Association for the Advancement of Science
Year
1991
Tongue
English
Weight
691 KB
Volume
251
Category
Article
ISSN
0036-8075

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Exact solution of large-scale, asymmetri
Exact solution of large-scale, asymmetric traveling salesman problems
โœ 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