The Travelling Santa Problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science.
Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.
Santa has a big problem with outlining his christmas route. To not overwork his reindeers, he would like to choose the shortest one. He will be travelling from town to town through all countries of the world.
You have to point out the optimal, that is the shortest, route for the Santa's Sleigh.