A Polynomial Time Algorithm for The Traveling Salesman Problem

Details A Polynomial Time Algorithm for The Traveling Salesman Problem A Polynomial Time Algorithm for The Traveling Salesman Problem

2006-10-09

arxiv.org/abs/cs/0610042v3

Complementary to Yannakakis' Theorem, 22nd MCCCC, University of Nevada, Las Vegas, 2008, p.8

Computer Science

Discrete Mathematics

8 pages. Simplified

Scientific paper

The ATSP polytope can be expressed by asymmetric polynomial size linear
program.

Affiliated with

Also associated with

No associations

Rating

A Polynomial Time Algorithm for The Traveling Salesman Problem 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 A Polynomial Time Algorithm for The Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Polynomial Time Algorithm for The Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342890