A branch-bound algorithm for a wiring problem

A simple computational method for solving a specific wiring problem related to the construction of the RC 4000 computer is described. The intimate relationship between the wiring problem and the traveling salesman problem is established, and the algorithm is based upon the branch and bound technique as employed by J.D.C. Little et al. 1] for solving the latter problem.Adapted from the thesis Fixed-cost and Other Network Flow Problems presented to The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark in partial fulfilment of the requirements for the licentiate degree, April 1967.