Channel routing by constraint logic
Nicholas C. Philips · 1992
Two layer dogleg optimal channel routing is a well known problem with a rich and varied Iitemturo of algorithmic t~hniquca and heuristics.A constraint logic program for this problem providca a striking example of the dsclarativc power of a constraint programming language.While it is not intended to be a channel router for real-fife large+cale instances of the problem, it does illustrate the promiss and limitations of the constraint logic programming pardgm, Moreover, the constraint logic program can perform VeIYwell when seeking near optimal solutions, suggcdng that such pmgrarns may become of practical USCeven for hard (W complete) problems.