Skip to main content

Advertisement

Log in

Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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

    Google Scholar 

  • Stockmeyer L (1983) Optimal Orientation of Cells in Slicing Floorplan Designs.Information and Control 57:91–101

    Google Scholar 

  • 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

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01415530

Key Words