Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 7 of 102
Back to Result List

Quadratic 0/1 Optimization and a Decomposition Approach for the Placement of Electronic Circuits.

Please always quote using this URN: urn:nbn:de:0297-zib-803
  • The placement in the layout design of electronic circiuts consists of finding a non- overlapping assignment of rectangular cells to positions on the chip so what wireability is guaranteed and certain technical constraints are met.This problem can be modelled as a quadratic 0/1- program subject to linear constraints. We will present a decomposition approach to the placement problem and give results about $NP$-hardness and the existence of $\varepsilon$-approximative algorithms for the involved optimization problems. A graphtheoretic formulation of these problems will enable us to develop approximative algorithms. Finally we will present details of the implementation of our approach and compare it to industrial state of the art placement routines. {\bf Keywords:} Quadratic 0/1 optimization, Computational Complexity, VLSI-Design.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel
Document Type:ZIB-Report
Tag:VLSI-Design; computational complexity; quadratic 0/1 optimization
Date of first Publication:1992/04/09
Series (Serial Number):ZIB-Report (SC-92-10)
ZIB-Reportnumber:SC-92-10
Published in:Appeared in: Mathematical Programming vol. 63 (1994) pp. 257-279
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.