Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. D. C. Little et al.,An Algorithm for The Traveling Salesman Problem, Operations Research, Vol. 11, 1963.
A. H. Land and A. G. Doig,An Automatic Method of Solving Discrete Programming Problems, Econometrica, Vol. 28, 1960.
E. L. Lawler and D. E. Wood,Branch-and-Bound Methods: A Survey, Operations Research, Vol. 14, 1966.
Author information
Authors and Affiliations
Additional information
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.
Rights and permissions
About this article
Cite this article
Krarup, J. A branch-bound algorithm for a wiring problem. BIT 9, 133–156 (1969). https://doi.org/10.1007/BF01933250
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01933250