Exact methods and heuristics for the Traveling Salesman Problem

Implementation of a MILP with Dantzig's and the MTZ subtour elimination constraints. Dantzig's constraints are added recursively. Scripts also contain a few heuristics for the TSP.