Constructing a Small Compact Binary Model for the Travelling Salesman Problem

  • J. Fabian Meier
    • Categories (Mixed) Integer Linear Programming, 0-1 Programming, Transportation Tags , , Short URL: https://optimization-online.org/?p=13527

    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

    Article

    Download

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