Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
- From: Patricia Shanahan <pats@xxxxxxx>
- Date: Thu, 02 Jun 2005 21:44:34 GMT
moustapha.diaby@xxxxxxxxxxxxxxxxxx wrote:
....
Bryan Olson wrote:
moustapha.diaby@xxxxxxxxxxxxxxxxxx wrote:
Hello All - A revised copy of my paper is now
available (http://www.business.uconn.edu/users/mdiaby/tsplp).
....
Step 1 of procedure PA is not well defined. Consider a graph with 8 cities; there are 7! c.a.s.s. path (that begin and end with city 1). I'll define and example feasible solution by assigning 1/7! units of flow to each c.a.s.s. path.
If that's not the procedure, what is?
-- --Bryan
From what you write, I am sure you are missing something from the
paper. I am not sure I see how to make things any clearer at this time
though. So, I will try if/when I do a next revision of the paper. I am
afraid you may have to wait till then.
How about supplying, either in the paper or on a web site, pseudo-code for Step 1 of procedure PA? That should make it clear. Or actual code, in any widely available language.
Patricia
.
- Follow-Ups:
- Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
- From: moustapha . diaby
- Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
- Prev by Date: Re: Halting problem undecidable or semidecidable?
- Next by Date: Re: are Real Numbers evil? The answer(?).
- Previous by thread: Halting problem undecidable or semidecidable?
- Next by thread: Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
- Index(es):
Relevant Pages
|
