Example Problem: A Travelling Salesman Problem
Find a shortest tour for the cities: Seattle, Bellingham, Spokane, Wenatchee, Portland.
Given: A matrix of intercity distances for these cities.
Tour: a Hamiltonian circuit -- a closed path that starts and ends at one city and visits every other city exactly once.
Our assumption: It’s possible to go from any city A to another city B without stopping (visiting) any other city C.