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

DOI10.1007/BF01415530zbMATH Open0768.90081OpenAlexW2036925640MaRDI QIDQ4031971FDOQ4031971

Authors: Michael Kolonko 

Publication date: 3 May 1993

Published in: ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415530

Recommendations

• Optimal module sizing in VLSI floorplanning by nonlinear programming
• scientific article; zbMATH DE number 3894985
• scientific article; zbMATH DE number 49142
• Compact floor-planning via orderly spanning trees
• scientific article; zbMATH DE number 510756

zbMATH Keywords

floorplansmultistage decisionVLSI-layoutautomated design of electronic circuits

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)

Cites Work

• Optimal orientations of cells in slicing floorplan designs
• Title not available (Why is that?)

Cited In (1)

• An attractor-repeller approach to floorplanning

This page was built for publication: Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031971)