Traveling Salesman Problem

What is the shortest possible route that visits each city.

You can consider this tutorial as a modeling exercise. To do so, just read the description and then compare your mathematical model with the one proposed. In the same way, you can start by coding your own model in Choco-solver before reading the proposed one.


Description

A description of the problem to model and solve.

Math

A mathematical model of the problem.

Code

A bunch of code.


Last modified 03.06.2020: Add TSP (13cc948)