An optimal algorithm for floorplan area optimization

Ting Chi Wang, D. F. Wong

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

49 Citations (Scopus)

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 [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 terminate, our algorithm produced optimal solutions in a few seconds.

Original languageEnglish
Title of host publication27th ACM/IEEE Design Automation Conference - Proceedings 1990
PublisherAssociation for Computing Machinery (ACM)
Pages180-186
Number of pages7
ISBN (Print)081869650X, 9780897913638, 0897913639
DOIs
Publication statusPublished - Jan 1991
Event27th ACM/IEEE Design Automation Conference, DAC 1990 - Orlando, United States
Duration: 24 Jun 199027 Jun 1990
https://dl.acm.org/doi/proceedings/10.1145/123186
https://ieeexplore.ieee.org/xpl/conhome/790/proceeding

Publication series

NameACM/IEEE Design Automation Conference - Proceedings
ISSN (Print)0738-100X

Conference

Conference27th ACM/IEEE Design Automation Conference, DAC 1990
Country/TerritoryUnited States
CityOrlando
Period24/06/9027/06/90
Internet address

Scopus Subject Areas

  • Engineering(all)

Cite this