An optimal algorithm for floorplan area optimization

Ting Chi Wang; D. F. Wong

doi:10.1145/123186.123253

An optimal algorithm for floorplan area optimization

Ting Chi Wang, D. F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-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 language	English
Title of host publication	27th ACM/IEEE Design Automation Conference - Proceedings 1990
Publisher	Association for Computing Machinery (ACM)
Pages	180-186
Number of pages	7
ISBN (Print)	081869650X, 9780897913638, 0897913639
DOIs	https://doi.org/10.1145/123186.123253
Publication status	Published - Jan 1991
Event	27th ACM/IEEE Design Automation Conference, DAC 1990 - Orlando, United States Duration: 24 Jun 1990 → 27 Jun 1990 https://dl.acm.org/doi/proceedings/10.1145/123186 https://ieeexplore.ieee.org/xpl/conhome/790/proceeding

Publication series

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

Conference

Conference	27th ACM/IEEE Design Automation Conference, DAC 1990
Country/Territory	United States
City	Orlando
Period	24/06/90 → 27/06/90
Internet address	https://dl.acm.org/doi/proceedings/10.1145/123186 https://ieeexplore.ieee.org/xpl/conhome/790/proceeding

Scopus Subject Areas

General Engineering

Access to Document

10.1145/123186.123253

Cite this

@inproceedings{de348b27c1c94bf9889019a86507e452,

title = "An optimal algorithm for floorplan area optimization",

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.",

author = "Wang, {Ting Chi} and Wong, {D. F.}",

note = "This work was partially supported by the National Science Foundation under grant MIP-8909586, by the Texas Advanced Research Program under grant 4096, and by an IBM Faculty Development Award.; 27th ACM/IEEE Design Automation Conference, DAC 1990 ; Conference date: 24-06-1990 Through 27-06-1990",

year = "1991",

month = jan,

doi = "10.1145/123186.123253",

language = "English",

isbn = "081869650X",

series = "ACM/IEEE Design Automation Conference - Proceedings",

publisher = "Association for Computing Machinery (ACM)",

pages = "180--186",

booktitle = "27th ACM/IEEE Design Automation Conference - Proceedings 1990",

address = "United States",

url = "https://dl.acm.org/doi/proceedings/10.1145/123186, https://ieeexplore.ieee.org/xpl/conhome/790/proceeding",

}

Wang, TC & Wong, DF 1991, An optimal algorithm for floorplan area optimization. in 27th ACM/IEEE Design Automation Conference - Proceedings 1990. ACM/IEEE Design Automation Conference - Proceedings, Association for Computing Machinery (ACM), pp. 180-186, 27th ACM/IEEE Design Automation Conference, DAC 1990, Orlando, Florida, United States, 24/06/90. https://doi.org/10.1145/123186.123253

TY - GEN

T1 - An optimal algorithm for floorplan area optimization

AU - Wang, Ting Chi

AU - Wong, D. F.

N1 - This work was partially supported by the National Science Foundation under grant MIP-8909586, by the Texas Advanced Research Program under grant 4096, and by an IBM Faculty Development Award.

PY - 1991/1

Y1 - 1991/1

N2 - 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.

AB - 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.

UR - https://dl.acm.org/doi/10.1145/123186.123253

UR - https://ieeexplore.ieee.org/document/114851

UR - http://www.scopus.com/inward/record.url?scp=0025546584&partnerID=8YFLogxK

U2 - 10.1145/123186.123253

DO - 10.1145/123186.123253

M3 - Conference proceeding

AN - SCOPUS:0025546584

SN - 081869650X

SN - 9780897913638

SN - 0897913639

T3 - ACM/IEEE Design Automation Conference - Proceedings

SP - 180

EP - 186

BT - 27th ACM/IEEE Design Automation Conference - Proceedings 1990

PB - Association for Computing Machinery (ACM)

T2 - 27th ACM/IEEE Design Automation Conference, DAC 1990

Y2 - 24 June 1990 through 27 June 1990

ER -

An optimal algorithm for floorplan area optimization

Abstract

Publication series

Conference

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this