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




Rados³aw Hofman wrote:
Hi all,

I took me some time and I had to learn many new things :-) but finally mine
counter-example for method shown by Moustapha Diaby in "P=NP Linear
programming formulation of the Traveling Salesman Problem" is finished. I
prepared all equations as mentioned in article run Soplex on them and result
shows that counter example is correct for model and of course not correct
for TSP.

Document (over 2 mb - sorry - it is a problem with size and number of
images) is available here:
http://www.teycom.pl/docs/Report_on_article_P_eq_NP.pdf

Any comments (including language corrections) are welcome (I worked on it
for 2 month and now I'm so tired with it that I cannot read it ;-).

Best regards,

Radek Hofman





Mr. Hofman,
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.
//MD

.



Relevant Pages

  • Re: P = NP, what are your opinions?
    ...  After Hofman finally got Diaby to see that he ... had found an explicit counterexample, ... it is easy to see that without the constraints in question ... this 2006 counter-example claim does not apply to any of the ...
    (comp.theory)
  • Re: P = NP, what are your opinions?
    ...  After Hofman finally got Diaby to see that he ... it is easy to see that without the constraints in question ... this 2006 counter-example claim does not apply to any of the ...
    (comp.theory)
  • Re: My LP Formulation of the TSP: Conclusions
    ... constraints on the y-variables *only* ... Could you tell us for what N 2.13 is not redundant? ... so you do not include them (refer to my original counter-example ...
    (comp.theory)
  • Re: Hofman and Diaby talk about P=NP at INFORMS 2007
    ... You asked us to determine how many constraints Moews and Hofman ... suggested has not uncovered the violated constraint. ...
    (comp.theory)
  • Re: Hofman and Diaby talk about P=NP at INFORMS 2007
    ... You asked us to determine how many constraints Moews and Hofman ... suggested has not uncovered the violated constraint. ...
    (comp.theory)