On a multinet wiring problem
- 1 May 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 20 (3) , 250-252
- https://doi.org/10.1109/tct.1973.1083680
Abstract
A multinet wiring problem is proposed. This problem has application in the routing of interconnection wires on integrated circuit chips and printed circuit boards. Optimal and suboptimal algorithms, based on the branch-and-bound method, are described for its solution.Keywords
This publication has 5 references indexed in Scilit:
- Suboptimal algorithm for a wire routing problemIEEE Transactions on Circuit Theory, 1972
- Computer-aided interconnection routing: General survey of the state-of-the-artNetworks, 1972
- A Counterexample to a Theorem of Fu on Steiner's ProblemIEEE Transactions on Circuit Theory, 1972
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966