So let's now go to difficult problems. We consider the travelling salesman problem. This a prototype of an NP-complete problem. So what is the problem here? We want to describe the convex hull of all tours in a complete graph. This is one tour for instance.