Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!usc!samsung!uunet!super!pcolsen
From: pcolsen@super.ORG (Peter C Olsen)
Newsgroups: comp.theory
Subject: Wanted --- Traveling Salesman Problem data (with solution)
Message-ID: <38288@super.ORG>
Date: 2 Dec 90 06:29:51 GMT
References: <9011300937.AA00204@geocub.greco-prog.fr> <38271@super.ORG>
Sender: news@super.ORG
Organization: Supercomputing Research Center, Bowie, Md.
Lines: 14



Can anyone point me toward data for the Travelling Salesman problem
with known solutions?  I experimenting with some Neural Network
approximations and I'd like some known standards against which to
compare.

Even more valuable would be an estimate of the length of the optimal
tour through n points generated by a spatial Poisson process with
parameter lambda.

Thanks.

Peter Olsen, pcolsen@super.super.org


Brought to you by Super Global Mega Corp .com