Traveling salesperson problems are a part of graph theory. The traveling salesperson problem involves finding the shortest circuit that connects all of the cities or stops that a salesperson would visit. This type of circuit is also referred to as a Hamiltonian circuit.
When a large number of cities is involved, it is often difficult to find the optimal solution to a traveling salesperson problem. The Round Trip Puzzle is a good place to work interactively with the problem.
For background information elsewhere on our site, explore the High School Discrete Math area of the Ask Dr. Math archives. To find relevant sites on the Web, browse and search Discrete Mathematics in our Internet Mathematics Library.
Access to these problems requires a Membership.
Home || The Math Library || Quick Reference || Search || Help