Abstract
In this paper we present an optimal algorithm for the floorplan area optimization problem. Our algorithm is based on an extension of the technique in [5]. Experimental results indicate that our algorithm is efficient and capable of successfully handling large floorplans. We compare our algorithm with the branch-and-bound optimal algorithm in [7]. The running time of our algorithm is substantially less than that of [7]. For several examples where the algorithm in [7] ran for days and did not terminate, our algorithm produced optimal solutions in a few seconds. © 1992 IEEE
Cite
CITATION STYLE
Wang, T. C., & Wong, D. F. (1992). Optimal Floorplan Area Optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11(8), 992–1002. https://doi.org/10.1109/43.149770
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
