Cycles · Traveling Salesman Problem
Lesson 1
Problem. What is the cheapest way to travel through all cities exactly once and return? (Formally: what is the minimum weight of a Hamiltonian cycle in the given graph?)
5 points
Cycles · Traveling Salesman Problem
Problem. What is the cheapest way to travel through all cities exactly once and return? (Formally: what is the minimum weight of a Hamiltonian cycle in the given graph?)