Re: Travelling Salesman

Newsgroups	comp.programming
Date	2023-06-19 18:50 -0700
References	<1993Dec7.141952.24784@infodev.cam.ac.uk>
Message-ID	<8398df0f-aa99-40ad-b4f3-7b19168fe3ecn@googlegroups.com> (permalink)
Subject	Re: Travelling Salesman
From	V õ l u r <nooneyenoneyouareright@mail.ee>

Show all headers | View raw

Why does the salesman have to travel, when he can sell everything from home ?




On Tuesday, December 7, 1993 at 4:19:52 PM UTC+2, S.J. Bignell wrote:
> I'm currently working on a project involving approximation algorithms to the
> Travelling Salesman Problem. Apparently Lin & Kernighan's heuristic algorithm
> published in Operations Research vol 21(I think) in 1973 is "the best yet".
> I have a copy of the paper, but can't understand the algorithm.
> Does anyone have source code in any language for this algorithm? Or can anyone
> explain it?
> Thanks
> Spencer Bignell
> sj...@cus.cam.ac.uk

Back to comp.programming | Previous | Next | Find similar

Thread

Re: Travelling Salesman V õ l u r <nooneyenoneyouareright@mail.ee> - 2023-06-19 18:50 -0700

csiph-web