From: Troy Bleeker
Subject: Branch and Bound Algorithm
Date: 
Message-ID: <TROYB.92Oct5101819@ivy.stat.ufl.edu>
I'm writing a program to solve the traveling salesman problem, and I
want use a Branch and Bound algorithm to search the tree for the
shortest path(s).

I would appreciate it if someone could give me a quick outline of the
algorithm and/or a description of how it works. 

You can post your response or e-mail me at:

·····@stat.ufl.edu

Troy