Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!fas-news.harvard.edu!newspump.wustl.edu!news.starnet.net!spool.mu.edu!uwm.edu!math.ohio-state.edu!howland.erols.net!news.sprintlink.net!news-peer.sprintlink.net!EU.net!Austria.EU.net!01-newsfeed.univie.ac.at!swidir.switch.ch!in2p3.fr!oleane!pasteur.fr!jussieu.fr!lcr.thomson-csf.fr!news.thomson-lcr.fr!laburthe
From: laburthe@dmi.ens.fr (Francois Laburthe)
Subject: TSP with constraints, CHIP ?
X-Nntp-Posting-Host: laika
Message-ID: <E14J86.Bu6@news.thomson-lcr.fr>
Keywords: TSP, CHIP
Sender: news@news.thomson-lcr.fr
Organization: Ecole Normale Superieure, Paris, France
Date: Tue, 19 Nov 1996 15:33:42 GMT
Lines: 21


We're preparing an article with Yves Caseau on constraint-based approaches 
to the TSP (Travelling Salesman Problem). We would like to know if anyone 
has experimented the "cycle" constraint of CHIP, (the global constraint 
which was specially designed for routing problems).

In particular, does anyone know how large "pure TSP" (with no additional
contraints) CHIP can solve, say in less than 5 minutes, and how large "TSPTW"
(TSP with time windows) ?

Thanks,


	Francois

Francois Laburthe
LIENS, Ecole Normale Superieure,
45 rue d'Ulm, 75005 Paris, France
laburthe@dmi.ens.fr

       
