DocumentCode
3333554
Title
An Application of Branch and Bound Method to Automatic Printed Circuit Board Routing
Author
Dysart, Lawrence ; Koifman, Mikhail
Author_Institution
Computervision Corporation, Bedford, MA
fYear
1979
fDate
25-27 June 1979
Firstpage
494
Lastpage
499
Abstract
This paper describes an approach to PCB routing which applies the Branch and Bound Method to the search for a path between two points. A special multiple pass method of pseudo-parallel routing is applied in order to insure that simple interconnections are made at the earliest stages. The algorithm has been implemented by Computervision Corporation on a 32K word, 16 bit minicomputer based system.
Keywords
Algorithm design and analysis; Application software; Computer graphics; Cost function; Integrated circuit interconnections; Joining processes; Microcomputers; Pins; Printed circuits; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1979. 16th Conference on
Type
conf
DOI
10.1109/DAC.1979.1600156
Filename
1600156
Link To Document