The traveling salesman problem: A Linear programming formulation of

Details The traveling salesman problem: A Linear programming formulation of The traveling salesman problem: A Linear programming formulation of

2006-09-02

arxiv.org/abs/cs/0609005v6

Computer Science

Computational Complexity

10 pages; Published in "WSEAS Transactions on Mathematics." Constraints added to rectify minor oversight in proof of propositi

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The traveling salesman problem: A Linear programming formulation of does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The traveling salesman problem: A Linear programming formulation of, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The traveling salesman problem: A Linear programming formulation of will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-109608