Advanced Conceptsbitmaskminimizationgraph
Traveling Salesman Problem
Given n cities and the travel cost between every pair of them, starting and ending at the same city, find the minimum-cost route that visits every other city exactly once.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.