ISSN:
1572-9125
Keywords:
Branch and Bound
;
discrete optimization
;
0–1 programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01933250
Permalink