Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time

moustapha.diaby@xxxxxxxxxxxxxxxxxx wrote:
Radoslaw Hofman wrote:

Finally I have pointed out proposition from your document which is
incorrect - proposition 4. You assume there that every possible
solution consists ONLY FROM VALID TSP TOURS! This is incorrect, because
you may combine some NON TSP TOURS and prepare instance perfectly
feasible for BLP having nothing common with solution for TSP.


Mr. Hofman,

I make one extra effort and point out to you that Proposition 4 in my
paper is not *assumed*. It is *proven*. I suggest to you that you
carefully study and try to understand the proof detailed for that
proposition. (I am assuming, of course, that your errors are sincere).

//MD


As an addendum to my previous message: The notion of TSP tours in (y,
z) used in Proposition 4 is actually developed from Propositions 2 and
3. Proposition 2 seems to be the one that is really escaping you. So,
that is probably the one you should focus on first.

//MD

.