Newsgroups: sci.op-research,comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.mathworks.com!newsfeed.internetmci.com!tank.news.pipex.net!pipex!howland.reston.ans.net!ix.netcom.com!netcom.com!netnews
From: martin@as.arizona.edu
Subject: Algorithm for Held and Karp lower bound on the TSP
Content-Type: TEXT/PLAIN; charset=US-ASCII
Message-ID: <NEWTNews.2008.806112556.martin@netcomsv.netcom.com.jse.slip.netcom.com>
Sender: netnews@mork.netcom.com
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
X-Newsreader: NEWTNews & Chameleon -- TCP/IP for MS Windows from NetManage
Mime-Version: 1.0
Date: Wed, 19 Jul 1995 00:04:23 GMT
Lines: 11
Xref: glinda.oz.cs.cmu.edu sci.op-research:3975 comp.ai.genetic:6397


Hello,

I've read the two papers from Held and Karp (1970 and 1971) on the lower
bound for the TSP.  Does anybody know if there exists code, or a simple
algorithm (as in the paper without the proofs, etc.) for their branch and
bound method (1971 paper) on finding a lower bound?

Martin Schlapfer
martin@as.arizona.edu

