Search

Branch and Bound Implementations for the Traveling Salesperson Problem - Part 3: Multi-threaded solution with many inexpensive nodes

By: Richard Wiener

Abstract

The multi-threaded implementation presented in this column sets the stage for the distributed processing implementation to be presented in the next column. In the previous column a best-first branch and bound algorithm was introduced and implemented. This algorithm forms the basis for this current column.

Cite as:

Richard Wiener, “Branch and Bound Implementations for the Traveling Salesperson Problem - Part 3: Multi-threaded solution with many inexpensive nodes”, Journal of Object Technology, Volume 2, no. 4 (July 2003), pp. 89-100, doi:10.5381/jot.2003.2.4.c8.

PDF | HTML | DOI | BiBTeX | Tweet this | Post to CiteULike | Share on LinkedIn