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

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


.