haku: @indexterm Travelling salesman problem / yhteensä: 62
viite: 17 / 62
| Tekijä: | Cowling, P. Maffioli, F. |
| Otsikko: | A bound for the Symmetric Travelling Salesman Problem through matroid formulation |
| Lehti: | European Journal of Operational Research
1995 : JUN 8, VOL. 83:2, p. 301-309 |
| Asiasana: | GRAPHS COMBINATIONAL OPTIMIZATION TRAVELLING SALESMAN PROBLEM |
| Kieli: | eng |
| Tiivistelmä: | A new bound for the Symmetric Traveling Salesman Problem is proposed, using a matroid theoretic formulation of the problem. The resulting bound is shown to present a link between the well-studied 1-tree and 2-matching bounds. Its potential is investigated. The Traveling Salesman Problem (TSP) is possibly the most extensively studied Combinatorial Optimization problem and has become an archetype in this field. |
SCIMA