Rectangle placement for VLSI testing

DOI10.1007/978-3-319-18008-3_2MaRDI QIDQ5741454zbMATH OpenOpenAlexFDO

Authors Merav Aharoni, Odellia Boni, Ari Freund, Lidor Goren, Wesam Ibraheem, Tamir Segev

Publication date 25 July 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18008-3_2

zbMATH Keywords

constraint programmingelectronic design automationfloorplanningnon-overlapping rectangles placement

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimal module sizing in VLSI floorplanning by nonlinear programming
• Floorplan design of VLSI circuits
• scientific article; zbMATH DE number 510756
• Introducing global constraints in CHIP
• Practical Automatic Placement for Standard-Cell Integrated Circuits

This page was built for publication: Rectangle placement for VLSI testing

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