A nonlinear optimization methodology for VLSI fixed-outline floorplanning
From MaRDI portal
Recommendations
- Optimal module sizing in VLSI floorplanning by nonlinear programming
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- scientific article; zbMATH DE number 50320
- The placement model and its nonlinear placement solver for VLSI global placement
- Global approaches for facility layout and VLSI floorplanning
Cites work
- A Modeling Language for Mathematical Programming
- A new mathematical-programming framework for facility-layout design
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- An attractor-repeller approach to floorplanning
- Floorplan design of VLSI circuits
- Floorplans, planar graphs, and layouts
- Large-scale linearly constrained optimization
- Optimal module sizing in VLSI floorplanning by nonlinear programming
- Semidefinite Programming
- Two-dimensional stochastic model for interconnections in master slice integrated circuits
Cited in
(10)- Optimal module sizing in VLSI floorplanning by nonlinear programming
- Mathematical optimization approach for facility layout on several rows
- Strong mixed-integer formulations for the floor layout problem
- Determinstic VLSI block placement algorithm using less flexibility first principle
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- A post-floorplanning wire length optimization algorithm based on integer linear programming
- An improved two-stage optimization-based framework for unequal-areas facility layout
- A fixed-outline floorplanning based on an improved discrete PSO
- Global approaches for facility layout and VLSI floorplanning
This page was built for publication: A nonlinear optimization methodology for VLSI fixed-outline floorplanning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016045)
