Abstract
We examine an algorithm for the compactification of an arrangement of rectangles in the plane as it is used for floorplans in the automated design of electronic circuits (also called sizing of floorplans). We reformulate this problem as a multistage decision problem and show that the algorithm is in fact the optimal solution obtained by the backward induction procedure of dynamic programing. The model allows generalisations to non-geometrical applications in scheduling and reliability.
Similar content being viewed by others
References
Dai WM, Kuh ES (1986) Hierarchical Floor Planning for Building Block Layout. Proceedings IEEE Int. Conf. CAD (ICCAD), Santa Clara, 454–457
Kolonko M (1990) Parallel Dynamic Programming with Applications to Layout Problems. Hildesheimer Informatikberichte 3/90, Universität Hildesheim
Lengauer T (1990) Combinatorial Algorithms for Integrated Circuit Layout. Teubner, Stuttgart, J Wiley, Chichester
Stockmeyer L (1983) Optimal Orientation of Cells in Slicing Floorplan Designs.Information and Control 57:91–101
Otten RHJM (1983) Efficient Floorplan Design. Proceedings IEEE Int. Conf. Computer Design (ICCD) 499–502
Zimmermann G (1988) A New Area and Shape Function Estimation Technique for VLSI Layouts. Proceedings ACM/IEEE Design Automation Conference 60–65
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kolonko, M. Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach. ZOR - Methods and Models of Operations Research 37, 75–95 (1993). https://doi.org/10.1007/BF01415530
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01415530