New perspectives in VLSI design automation: deterministic packing by sequence pair

DOI10.1007/s10479-008-0460-9zbMath1201.90171OpenAlexW2091205413MaRDI QIDQ610960

Andrzej Kozik, Adam Janiak, Maciej Lichtenstein

Publication date: 13 December 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0460-9

zbMATH Keywords

VLSIdesign automationblock packing problemfloorplan

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Scheduling under the network of temporo-spatial proximity relationships ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rotational polygon overlap minimization and compaction
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• Orthogonal Packings in Two Dimensions