Travelling Salesman (Minimum Tour Cost)

Given the cost matrix of travelling between n cities, print the minimum cost of a tour that starts at city 0, visits every city exactly once and returns to city 0.

2 <= n <= 16 1 <= cost <= 10^4 (diagonal is 0)