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

In article <ehagmr$eav$1@xxxxxxxxxxxxxxxxxxxxxxx>,
Rados³aw Hofman <radekh@xxxxxxxxx> wrote:
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.

Amazing! That's a wonderful public service. Have you contacted
Diaby directly? The other thing I would suggest is to make available a
machine-readable version of your problem instance so that someone else
can easily download it and verify your computation. I've never used
Soplex but I assume it can work with MPS format, which I personally feel
is an awful format but which has the huge advantage of being mostly
standardized so that almost any solver can read 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
.