## Experiments on Geometric Travelling Salesman Heuristics

- Bentley, J.L
- AT&T Computing Science Technical Report,
- 1990

- Published 1992 in Australasian J. Combinatorics

The well-known travelling salesman problem can be expressed in graphtheoretic terms as follows : find a minimum-weight Hamiltonian cycle in a connected edge-weighted graph G(N, A). vVe concentrate here on the problem where G is large and sparse, i.e., where INI is 500 or more and IAI is O( INI). Such graphs arise frequently in practice, where G represents a… (More)

### Presentations referencing similar topics