Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!samsung!emory!hubcap!rig
From: rig@eng.umd.edu (Ronald Greenberg)
Newsgroups: comp.parallel
Subject: Re: Traveling Salesman on hypercube
Message-ID: <1991Mar1.211341.19930@eng.umd.edu>
Date: 1 Mar 91 21:13:55 GMT
References: <1991Mar1.100736.15465@irisa.fr>
Sender: fpst@hubcap.clemson.edu
Organization: College of Engineering, Maryversity of Uniland, College Park
Lines: 18
Approved: parallel@hubcap.clemson.edu

In article <1991Mar1.100736.15465@irisa.fr> lahjomri@irisa.fr (Zakaria Lahjomri) writes:
>I am looking for a Traveling Salesman program on an hypercube iPSC/2
>in order to compare message-based implementation versus virtual
>shared memory implementation.

This is not exactly what you were looking for, but you can find
implementatiions of some traveling salesman heuristics in *LISP for
the Connection Machine in

Ron Greenberg, Cindy Phillips, and Joel Wein.
Euclidean traveling salesman heuristics.
In Leiserson, Leighton, Plotkin, editors.
Connection Machine Projects.
Technical Report MIT/LCS/RSS 4, Laboratory for Computer Science,
Massachusetts Institute of Technology, January 1989.
--

Ron Greenberg		rig@eng.umd.edu