The tspcutx.lng Model

Traveling Salesman Problem. Simple version

View the model
Download the model

Find the shortest tour that visits each city exactly once.
Subtour elimination method. We add a row/cut/constraint
to cut off a subtour until a full tour is found;

Keywords:

Cut generation | TSP | Traveling Salesman | Tours | Subtour Elimination |