![]() |
. | . | ![]() |
. | ||||
On a tour construction heuristic for the asymmetric TSP
Abstract:In this paper we deal with a new tour construction procedure for the asymmetric traveling salesman problem. This heuristic is based on a new patching operation which joins three subtours together. Regarding the efficiency of this procedure, we present an empirical analysis. Gyenizse Pal 1996. Augusztus 29. Csütörtök 10:08:45 MET DST |
||||||||
| Webmaster:webmaster@inf.u-szeged.hu |