Skip to Main Content
An analytic procedure for the three-layer channel routing problem is presented. The channel routing problem is formulated as a quadratic 0-1 integer programming where the quadratic function represents the amount of internet overlap, followed by a postprocessing heuristic procedure to improve the result. Experiments on the benchmark examples produced optimal results for nearly all the examples. The proposed algorithm can be generally applied to multilayer routing problems.
Date of Publication: 27 Aug. 1992