Branch and Bound Algorithm

Article View: comp.lang.lisp.x

Article #206

#206

From: Troy Bleeker
Date: Mon, 05 Oct 1992 10:28

10 lines
760 bytes

I'm writing a program to solve the traveling salesman problem, and I
would like to use the branch and bound algorithm. I would appreciate it
if someone could send me an outline of the algoritm and/or a description
of it works.

Please post or e-mail responses to 

troyb@stat.ufl.edu

Troy

Technical Details

Message-ID: <TROYB.92Oct5102807@ivy.stat.ufl.edu>

Path:

arc1-ca.pugleaf.net!sparky!uunet!convex!darwin.sura.net!sgiblab!sdd.hp.com!uakari.primate.wisc.edu!eng.ufl.edu!usenet.eng.ufl.edu!troyb

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.lisp.x
Path: arc1-ca.pugleaf.net!sparky!uunet!convex!darwin.sura.net!sgiblab!sdd.hp.com!uakari.primate.wisc.edu!eng.ufl.edu!usenet.eng.ufl.edu!troyb
From: troyb@stat.ufl.edu (Troy Bleeker)
Subject: Branch and Bound Algorithm
Message-ID: <TROYB.92Oct5102807@ivy.stat.ufl.edu>
Sender: news@eng.ufl.edu (Usenet Diskhog System)
Organization: University of Fl, Department of Statistics
Distribution: comp.lang.lisp.x
Date: 5 Oct 92 10:28:07
Lines: 10