On convex formulation of the floorplan area minimization problem

13 years 9 months ago

Download www.cecs.uci.edu

It is shown that the oorplan area minimization problem can be formulated as a convex programming problem with the numbers of variables and constraints signi cantly less than those previously published.

Temo Chen, Michael K. H. Fan

Real-time Traffic

Area Minimization Problem | Convex Programming Problem | Hardware | ISPD 1998 |

claim paper

» Largescale fixedoutline floorplanning design using convex optimization techniques

» Efficient Approximation Algorithms for Floorplan Area Minimization

» On Increasing Signal Integrity with Minimal Decap Insertion in AreaArray SoC Floorplan Des...

» A revisit to floorplan optimization by Lagrangian relaxation

» A Convex Formulation of Continuous Multilabel Problems

» CMP aware shuttle mask floorplanning

» Hierarchical Global Floorplacement Using Simulated Annealing and Network Flow Area Migrati...

» Fixedoutline Floorplanning through Better Local Search

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ISPD
Authors	Temo Chen, Michael K. H. Fan

Comments (0)

Sciweavers

On convex formulation of the floorplan area minimization problem

Area Minimization Problem | Convex Programming Problem | Hardware | ISPD 1998 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers