A quasi-Newton-based floorplanner for fixed-outline floorplanning
From MaRDI portal
Publication:2668641
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
- A Limited Memory Algorithm for Bound Constrained Optimization
- An efficient deterministic heuristic for two-dimensional rectangular packing
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
- Line search algorithms with guaranteed sufficient decrease
- Optimization by simulated annealing
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Representations of quasi-Newton matrices and their use in limited memory methods
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
Cited in
(3)
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)