Sciweavers

Share
ISPD
1998
ACM

On convex formulation of the floorplan area minimization problem

10 years 2 months ago
On convex formulation of the floorplan area minimization problem
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
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where ISPD
Authors Temo Chen, Michael K. H. Fan
Comments (0)
books