# Constructing a Small Compact Binary Model for the Travelling Salesman Problem

A variety of formulations for the Travelling Salesman Problem as Mixed Integer Program have been proposed. They contain either non-binary variables or the number of constraints and variables is large. We want to give a new formulation that consists solely of binary variables; the number of variables and the number of constraints are of order $O(n^2 \ln (n)^2)$.

## Citation

Institute of Transport Logistics TU Dortmund 07/2015