Re: P=NP: Linear Programming Formulation of the TSP

Isn't it a solved problem that TSP CAN NOT be formulated into a Linear
Programming that can be solved in polynomial time?

I heard some story from my advisor. There was a professor in Canada
tried to formulate TSP using LP to prove P=NP. He had several versions
of papers about it, of course, there were alway flaws in. Later on,
some authors from Japan proved that this method will not work.

Forgive me for this non-academic description. Maybe some people here
can give some references about this story, :)

regards,
yalding

.