Newsgroups: comp.parallel
From: marcov@win.tue.nl (Marco Verhoeven)
Subject: Re: Travelling Salesman Problem, advice concerning?
Organization: Eindhoven University of Technology, the Netherlands
Date: Thu, 9 Feb 1995 17:07:58 GMT
Message-ID: <3hcqo7$3o7@wsinis08.win.tue.nl>

In article <STEVE.95Feb7102842@eowyn.gte.com>,
Steve Preston <stakutis@mc.com> wrote:
>
>We have a new system that we believe produces [near] optimal
>solutions for large values of n.  We can only prove this
>by comparing to some known set of data-points and output.
>
>Any help would be appreciated.
>
>Chris Stakutis
>

A benchmark set of TSP instances can be obtained by
telnet  elib.zib-berlin.de (130.73.108.11), and login as elib.

--
  Marco Verhoeven
  Department of Mathematics and Computing Science
  Eindhoven University of Technology
  P.O. Box 513  
  5600 MB Eindhoven, the Netherlands



