Branch and Bound Algorithm

Thread View: comp.lang.lisp.x

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Troy Bleeker Mon, 05 Oct 1992 10:28

#206

Author: 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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads