论文信息 - On convex formulation of the floorplan area minimization problem

On convex formulation of the floorplan area minimization problem

It is sho wn that the floorplan area minimization problem can be formulated as a convex programming problem with the n umbers of variables and constraints significantly less than those previously published.

Michael K. H. Fan | Temo Chen | M. Fan | Temo Chen

[1] S. Hakimi,et al. Globally optimal floorplanning for a layout problem , 1996 .

[2] Israel Koren,et al. Floorplans, planar graphs and layouts , 1988 .

[3] Weiping Shi,et al. A fast algorithm for area minimization of slicing floorplans , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4] E. Rosenberg,et al. Optimal module sizing in VLSI floorplanning by nonlinear programming , 1989, ZOR Methods Model. Oper. Res..

[5] Naveed A. Sherwani,et al. Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[6] R. J. Mack,et al. VLSI physical design automation: theory and practice , 1996 .

[7] Larry J. Stockmeyer,et al. Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..

[8] C. L. Liu,et al. Area minimization for floorplans , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9] G. McCormick. Nonlinear Programming: Theory, Algorithms and Applications , 1983 .