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.

• Type: Conference
• Year: 1998
• Where: ISPD
• Authors: Temo Chen, Michael K. H. Fan
• Keywords: Area Minimization Problem, Convex Programming Problem, Hardware, ISPD 1998