The traveling salesman problem: A Linear programming formulation
Computational Complexity
2014-07-11 v7 Discrete Mathematics
Abstract
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. (The exposition and proofs are much more detailed in an edition which I wrote in collaboration with Dr. M.H. Karwan in 2012-2014 . That edition is available at http://users.business.uconn.edu/mdiaby/P=NPProofPapers/tspPaper.pdf)
Keywords
Cite
@article{arxiv.cs/0609005,
title = {The traveling salesman problem: A Linear programming formulation},
author = {Moustapha Diaby},
journal= {arXiv preprint arXiv:cs/0609005},
year = {2014}
}
Comments
10 pages; Published in "WSEAS Transactions on Mathematics." Constraints added to rectify minor oversight in proof of proposition 2 (Theoretical development is same). Hofman's claim of a "counter-example" (arXiv cs/0610125 and cs/0611008) is invalid: violates constraints 2.11-2.15