Recently, Fischetti, Lodi and Toth [15] surveyed exact methods for the Asymmetric Traveling Salesman Problem (ATSP) and computationally compared branch-and-bound and branch-and-cut codes. The results of this comparison proved that branch-and-cut is the most effective method to solve hard ATSP instances. In the present paper the branch-and-cut algorithms by Fischetti and Toth [17] and by Applegate, Bixby, Chvátal and Cook [2] are considered and tested on a set of 35 real-world instances including 16 new instances recently presented in [12]. © Springer-Verlag Berlin Heidelberg 2003.
Solving real-world ATSP instances by branch-and-cut / Fischetti M.; Lodi A.; Toth P.. - STAMPA. - 2570:(2003), pp. 64-77. (Intervento presentato al convegno Aussois Combinatorial Optimization Workshop tenutosi a Aussois nel 2002) [10.1007/3-540-36478-1_8].
Solving real-world ATSP instances by branch-and-cut
Lodi A.;Toth P.
2003
Abstract
Recently, Fischetti, Lodi and Toth [15] surveyed exact methods for the Asymmetric Traveling Salesman Problem (ATSP) and computationally compared branch-and-bound and branch-and-cut codes. The results of this comparison proved that branch-and-cut is the most effective method to solve hard ATSP instances. In the present paper the branch-and-cut algorithms by Fischetti and Toth [17] and by Applegate, Bixby, Chvátal and Cook [2] are considered and tested on a set of 35 real-world instances including 16 new instances recently presented in [12]. © Springer-Verlag Berlin Heidelberg 2003.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
