Global approaches for facility layout and VLSI floorplanning

Beitrag in einem Sammelwerk
(Originalarbeit)


Details zur Publikation

Autorinnen und Autoren: Anjos M, Liers F
Herausgeber: Miguel F. Anjos, Jean B. Lasserre
Titel Sammelwerk: Handbook on Semidefinite, Conic and Polynomial Optimization
Verlag: Springer New York LLC
Jahr der Veröffentlichung: 2012
Titel der Reihe: International Series in Operations Research & Management Science
Band: 166
Seitenbereich: 849-877


Abstract


This chapter provides an overview of conic optimization models for facility layout and VLSI floorplanning problems. We focus on two classes of problems to which conic optimization approaches have been successfully applied, namely the single-row facility layout problem, and fixed-outline floorplanning in VLSI circuit design. For the former, a close connection to the cut polytope has been exploited in positive semidefinite and integer programming approaches. In particular, the semidefinite optimization approaches can provide global optimal solutions for instances with up to 40 facilities, and tight global bounds for instances with up to 100 facilities. For the floorplanning problem, a conic optimization model provided the first non-trivial lower bounds in the literature.



FAU-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

Liers-Bergmann, Frauke Prof. Dr.
Professur für Angewandte Mathematik (Ganzzahlige und robuste Optimierung)


Einrichtungen weiterer Autorinnen und Autoren

University of Waterloo (UW)


Zitierweisen

APA:
Anjos, M., & Liers, F. (2012). Global approaches for facility layout and VLSI floorplanning. In Miguel F. Anjos, Jean B. Lasserre (Eds.), Handbook on Semidefinite, Conic and Polynomial Optimization. (pp. 849-877). Springer New York LLC.

MLA:
Anjos, Miguel, and Frauke Liers. "Global approaches for facility layout and VLSI floorplanning." Handbook on Semidefinite, Conic and Polynomial Optimization. Ed. Miguel F. Anjos, Jean B. Lasserre, Springer New York LLC, 2012. 849-877.

BibTeX: 

Zuletzt aktualisiert 2018-20-10 um 14:53