Global approaches for facility layout and VLSI floorplanning

Anjos M, Liers F (2012)


Publication Status: Published

Publication Type: Book chapter / Article in edited volumes

Publication year: 2012

Publisher: Springer New York LLC

Edited Volumes: Handbook on Semidefinite, Conic and Polynomial Optimization

Series: International Series in Operations Research & Management Science

Book Volume: 166

Pages Range: 849-877

DOI: 10.1007/978-1-4614-0769-0_29

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.

Authors with CRIS profile

Involved external institutions

How to cite

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: Download