Example 3: Travelling Salesman problem
Given: n associated cities and distances among them
Find: tour of minimum length that visits all of city.
Solutions: How several tours are possible?
n*(n -1)...*1 = n!
Because n! > 2(n-1)
Therefore n! = ? (2^{n}) (lower bound)
As of now, there is no algorithm that determines a tour of minimum length plus covers all of the cities in polynomial time. But, there are many very good heuristic algorithms.