This repository provides an implementation of Miller-Tucker-Zemlin formulation for traveling salesman problem (TSP). This formulation was introduced by Miller, Tucker, and Zemlin (1960) and has been widely considered as one of two classical formulation of TSP.
- Codes are written in Python using Pyomo framework.
- Solved with Gurobi optimization solver (under an academic license).
This software is licensed under the MIT License. See file LICENSE for more information.