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 floorpla:ns. We compare our algorithm with the branch-and-bound (optimal algorithm in [6]. The running time of our algorithm is substantially less than that of [6]. For several examples where the algorithm in [6] ran for days and did not termin.ate, our algorithm produced optimal solutions in a few seconds.
No takes yet. Share an insight, caveat, or question.
Wang et al. (1990) studied this question.