Minimizing Total Wire Length by Flipping Modules

초록

We consider the problem of flipping modules about their horizontal and/or vertical axes so as to minimize the estimated total wire length. Polynomial time algorithms are proposed for some classes of module layouts. Further, it is shown that a simple greedy heuristic often outperforms the neural network and simulated annealing heuristics proposed earlier for this problem. © 1993 IEEE