Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- From: moustapha.diaby@xxxxxxxxxxxxxxxxxx
- Date: 25 Oct 2006 08:20:48 -0700
On Oct 24, 6:20 pm, t...@xxxxxxxxxxxxx wrote:
In article <1161720167.777786.274...@xxxxxxxxxxxxxxxxxxxxxxxxxxx>, <moustapha.di...@xxxxxxxxxxxxxxxxxx> wrote:<"There are errors in your document. The flow structures you describe in
<your figures 2 and 3 are not possible in my model. Specifically, in
<Figure 3, the flow patterns over rows 5 -6 and rows 7-8 would violate
<the "visit restrictions" constraints (constraints 2.14 in latest
<version) of my model. Similarly, the flow patterns in Figure 4 (row 10,
<columns 9&15) and (row 11, columns 4&10) and (row 16, cols 10&15)
<violate the same constraints."
<
<and point out to you that the above applies to all the figures with
<"valleys" you have in your document.
He already responded to this objection. Are you actually reading his paper
and his responses carefully? It doesn't seem like it.
--
Tim Chow tchow-at-alum-dot-mit-dot-edu
The range of our projectiles---even ... the artillery---however great, will
never exceed four of those miles of which as many thousand separate us from
the center of the earth. ---Galileo, Dialogues Concerning Two New Sciences
Dr. Chow:
Mr. Hofman's document has so many incorrect statements and
assumptions in it (putting aside the English) that it would take me a
document perhaps as large as his own to enumerate and explain them all.
Unfortunately, I neither have the energy nor the time at this time...
All (or almost all) the premises Mr. Hofman uses leading to his final
construct that is, in turn, impossible to check properly (since the
required LP cannot be implemented) contradict the mathematics of the
situation, as I have pointed out in my previous posts.
But, you, Dr. Chow, hold a Ph.D. degree in mathematics from one of the
best universities on the planet (MIT).
I think it is reasonable to assume that you would have thoroughFrom the keen interest you have shown in my work over the past 2 years,
knowledge of it at this time(?). Also, it seems you have some
understanding of Mr. Hofman's imaginary constructs (?).
So, I think the easiest thing for you to do (and in fact, I eagerly
invite you to do this) is for you to simply point out the flaw(s) in
the (very humble) mathematics in my paper.
That would be the real service to me, and perhaps, the community!
//MD
.
- Follow-Ups:
- References:
- Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- From: Radosław Hofman
- Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- From: moustapha . diaby
- Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- From: Radoslaw Hofman
- Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- From: moustapha . diaby
- Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- From: tchow
- Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- Prev by Date: CFP: APPLIED COMPUTING 2007 - Submission Deadline extended
- Next by Date: Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- Previous by thread: Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- Next by thread: Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- Index(es):
Relevant Pages
|