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 . 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 . The running time of our algorithm is substantially less than that of . For several examples where the algorithm in  ran for days and did not terminate, our algorithm produced optimal solutions in a few seconds.
|Original language||English (US)|
|Number of pages||11|
|Journal||IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems|
|State||Published - Aug 1992|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering