BIT Numerical Mathematics

, Volume 9, Issue 2, pp 133–156 | Cite as

A branch-bound algorithm for a wiring problem

  • Jakob Krarup


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.

Key words

Branch and Bound discrete optimization 0–1 programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. D. C. Little et al.,An Algorithm for The Traveling Salesman Problem, Operations Research, Vol. 11, 1963.Google Scholar
  2. 2.
    A. H. Land and A. G. Doig,An Automatic Method of Solving Discrete Programming Problems, Econometrica, Vol. 28, 1960.Google Scholar
  3. 3.
    E. L. Lawler and D. E. Wood,Branch-and-Bound Methods: A Survey, Operations Research, Vol. 14, 1966.Google Scholar

Copyright information

© BIT Foundations 1969

Authors and Affiliations

  • Jakob Krarup
    • 1
  1. 1.The Institute of Mathematical Statistics and Operations ResearchThe Technical University of DenmarkLyngbyDenmark

Personalised recommendations