Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!Germany.EU.net!EU.net!sun4nl!hsahgl!hdewaard
From: hdewaard@hgl.signaal.nl (Waard H.W. de)
Subject: Re: Asymmetric traveling salesman problem
Message-ID: <1995Jan19.104344.4773@hgl.signaal.nl>
Sender: usenet@hgl.signaal.nl (USENET News System)
Nntp-Posting-Host: 193.0.0.6
Organization: Hollandse Signaal apparaten BV
X-Newsreader: TIN [version 1.2 PL2]
References: <3f6c3r$2rr@rc1.vub.ac.be>
Date: Thu, 19 Jan 1995 10:43:44 GMT
Lines: 27

Marco Dorigo (mdorigo@is3.vub.ac.be) wrote:
: I am looking references to both papers and software concerned with the
: asymmetric traveling salesman problem.

: Any pointers that you can give me will be appreciated.


: Marco Dorigo, Ph.D.
: IRIDIA
: Universite' Libre de Bruxelles
: Avenue Franklin Roosevelt 50
: CP 194/6
: 1050 Bruxelles, Belgium
: tel. +32-2-6503167
: fax +32-2-6502715
: mdorigo@ulb.ac.be


A description and algorithm can be found in:

title: The Traveling Salesman Problem
authors: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys
published by: Wiley Interscience
year: 1992
--
Huub de Waard
============= Unclassified ============
