loading...
Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization
Banff, Alberta, Canada July 20-July 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IWSOC.2005.69Fifth International Workshop on Syste ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
P. L. Takouda, University of Waterloo
M. F. Anjos, University of Waterloo
A Vannelli, University of Waterloo
We investigate the application of Semidefinite Programming (SDP) techniques to the VLSI macrocell floorplanning problem. We propose a new mixed-integer SDP formulation of the problem which leads to new SDP relaxations. This approach has been implemented and we report global lower bounds for some MCNC benchmark macrocell problems.
Citation:
P. L. Takouda, M. F. Anjos, A Vannelli, "Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization," iwsoc, pp.275-280, Fifth International Workshop on System-on-Chip for Real-Time Applications (IWSOC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.