Path: utzoo!attcan!uunet!umich!cs.utexas.edu!usc!sdd.hp.com!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!emory!hubcap!"L.
From: kale@cs.uiuc.edu (L. V. Kale')
Newsgroups: comp.parallel
Subject: Re: Traveling-Salesman: Beispielproblem
Message-ID: <11218@hubcap.clemson.edu>
Date: 29 Oct 90 13:38:56 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 10
Approved: parallel@hubcap.clemson.edu

I will also be interested in a collection of test problems
to test /compare parallel implementations of TSPs.
I think such a collection should be partitioned according
to whether the underlying cost matrix obeys triangular equality
or not, and provide an estimate of complexity for each problem.

I am not sure understood the full message in German, so pardon
any misunderstandinng on my part.

Kale