A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem
Discrete Mathematics
2016-10-21 v6
Abstract
In this paper, we present a new linear programming (LP) formulation of the Traveling Salesman Problem (TSP). The proposed model has O(n^8) variables and O(n^7) constraints, where n is the number of cities. Our numerical experimentation shows that computational times for the proposed linear program are several orders of magnitude smaller than those for the existing model [3].
Keywords
Cite
@article{arxiv.0803.4354,
title = {A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem},
author = {Moustapha Diaby},
journal= {arXiv preprint arXiv:0803.4354},
year = {2016}
}
Comments
Theorem 25 and Corollary 26 are incorrect. The modeling needs 9-dimensional variables instead of the 8-dimensional variables defined in notations 10.2. For fully-detailed exposition of the correct model see the book available at: The correct modeling is fully detailed in the book available at: http://www.worldscientific.com/worldscibooks/10.1142/9725