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

DOI10.1007/BF01415530zbMath0768.90081OpenAlexW2036925640MaRDI QIDQ4031971

Michael Kolonko

Publication date: 3 May 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 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

zbMATH Keywords

floorplansmultistage decisionVLSI-layoutautomated design of electronic circuits

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimal orientations of cells in slicing floorplan designs

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