Traveling tourist problem

From Wikipedia, the free encyclopedia

In combinatorial optimization, a mathematical discipline, the traveling tourist problem is similar to the traveling salesman problem: a tourist wishes to see all monuments (nodes) in a city, and so must visit each monument or a neighbour thereof (it is assumed that a monument is visible from any of its neighbours – the edges therefore represent lines of sight). The resulting walk will therefore visit a subset of all nodes in the graph.

References

Guha, Sudipto; Khuller, Samir (April 28–30, 1997). "Connected Facility Location Problems". DIMACS Workshop on Network Design: Connectivity and Facilities Location. American Mathematical Society. p. 180. Check date values in: |date= (help)

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.