Re: P=NP: Linear Programming Formulation of the TSP
- From: Mike Robson <robson@xxxxxxxxxxxxxx>
- Date: 26 Apr 2005 08:57:53 GMT
On 2005-04-25, Yajun <yalding@xxxxxxxxx> wrote:
> 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
>
There was certainly a professor from Canada who claimed to have proved
P=NP but using a linear programming formulation of graph isomorphism.
I proved that this couldn't work (Technical report: On Linear Programming,
Graph Isomorphism and NP-Complete Problems,
TR-CS-93-03, Department of Computer Science,
Australian National University).
Maybe you heard a slightly garbled version of this story?
J.M. (Mike Robson).
.
- Follow-Ups:
- References:
- Re: P=NP: Linear Programming Formulation of the TSP
- From: jarfo
- Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
- Re: P=NP: Linear Programming Formulation of the TSP
- From: jarfo
- Re: P=NP: Linear Programming Formulation of the TSP
- From: Yajun
- Re: P=NP: Linear Programming Formulation of the TSP
- Prev by Date: Re: discuss dancing links
- Next by Date: Re: P=NP: Linear Programming Formulation of the TSP
- Previous by thread: Re: P=NP: Linear Programming Formulation of the TSP
- Next by thread: Re: P=NP: Linear Programming Formulation of the TSP
- Index(es):
Relevant Pages
|