Re: P=NP: Linear Programming Formulation of the TSP
- From: A.L. <alewando_tego_nie@xxxxxxxxxxx>
- Date: Sun, 24 Apr 2005 22:09:43 -0500
On 24 Apr 2005 14:54:24 -0700, moustapha.diaby@xxxxxxxxxxxxxxxxxx
wrote:
>
>A. L. wrote:
>>
>> By the way, what is the difference between your approach and one
>> presented by Dantzig, Fulkerson and Johnston in 1954?... LP
>> formulation of TSP is sort of classical LP 101 example...
>>
>> A.L.
>
>
>The 101 diffrence is that between an Lp and IP.
Could you be more specific, please?...
A.L.
.
- 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: A . L .
- Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
- Re: P=NP: Linear Programming Formulation of the TSP
- From: A . L .
- Re: P=NP: Linear Programming Formulation of the TSP
- From: moustapha . diaby
- Re: P=NP: Linear Programming Formulation of the TSP
- Prev by Date: What's This Model of Computing Called?
- Next by Date: Re: Not constructive proof of existing of an algorithm
- 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):