VLSI Placement Using Quadratic Programming and Network Partitioning Techniques
Publication:3842992
DOI10.1111/j.1475-3995.1997.tb00091.xzbMath0906.90081OpenAlexW4254610778MaRDI QIDQ3842992
Anthony Vannelli, Andrew Kennings
Publication date: 5 November 1998
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.1997.tb00091.x
quadratic programmingclusteringcircuit partitioningVLSI cell placementgreedy cell interchange heuristics
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Quadratic programming (90C20) Production models (90B30) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple-way network partitioning
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Preconditioned conjugate gradient methods for three‐dimensional linear elasticity
- LOQO:an interior point code for quadratic programming
This page was built for publication: VLSI Placement Using Quadratic Programming and Network Partitioning Techniques