Abstract
Routing of conductor paths necessary for proper interconnection of elements in a given circuit has been one of the most difficult steps in the automated design of printed circuit boards artwork. Various algorithms—mostly heuristic—have been proposed with various degrees of success. The article presents a review of various techniques and the factors that affect the performance. A heuristic algorithm developed by the authors is also briefly mentioned.