haku: @indexterm Travelling salesman problem / yhteensä: 62
viite: 6 / 62
| Tekijä: | Lysgaard, J. |
| Otsikko: | Cluster based branching for the asymmetric travelling salesman problem |
| Lehti: | European Journal of Operational Research
1999 : DEC 1, VOL. 119:2, p. 314-325 |
| Asiasana: | OPERATIONAL RESEARCH TRAVELLING SALESMAN PROBLEM CLUSTER ANALYSIS |
| Kieli: | eng |
| Tiivistelmä: | This paper presents a new branching scheme for the asymmetric travelling salesman problem (ATSP) based on clusters. A cluster is defined as a node set with the characteristic that there exists an optimal solution in which the nodes in the node set are visited consecutively. The paper considers identification of clusters, implementation of a cluster based branching scheme, and cluster based dominance tests. |
SCIMA