A linear programming formulation of the traveling Salesman problem

Authors:
Moustapha Diaby
Affiliations:
Operations and Information Management, Storrs, CT
Venue:
MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics
Year:
2007

Citing 2
Cited 0

Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a network flow-based, polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). Computational results are discussed.