A quasi-Newton-based floorplanner for fixed-outline floorplanning
From MaRDI portal
Publication:2668641
DOI10.1016/J.COR.2021.105225OpenAlexW3119990280MaRDI QIDQ2668641FDOQ2668641
Authors: Pengli Ji, Kun He, Zhengli Wang, Yan Jin, Jigang Wu 
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105225
Recommendations
- A fixed-outline floorplanning based on an improved discrete PSO
- Triangulation algorithms for generating as-is floor plans
- Recent developments in floorplan representations
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
- Generalized floorplans from assigned room adjacencies
- An attractor-repeller approach to floorplanning
- Graph-based techniques to speed up floorplan area optimization
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
Cites Work
- Optimization by simulated annealing
- A Limited Memory Algorithm for Bound Constrained Optimization
- Line search algorithms with guaranteed sufficient decrease
- Representations of quasi-Newton matrices and their use in limited memory methods
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
Cited In (3)
Uses Software
This page was built for publication: A quasi-Newton-based floorplanner for fixed-outline floorplanning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668641)
