Efficient preprocessing for VLSI optimization problems
From MaRDI portal
Recommendations
- VLSI circuit performance optimization by geometric programming
- Combinatorial optimization in VLSI design
- Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout
- scientific article; zbMATH DE number 30953
- scientific article; zbMATH DE number 1058028
- Multilevel optimization in VLSICAD
- Multiscale optimization in VLSI physical design automation
- Integer programming in VLSI design
- A methodology for algorithm regularization and mapping into time-optimal VLSI arrays
- Optimal VLSI circuits for sorting
Cites work
- scientific article; zbMATH DE number 1321108 (Why is no real title available?)
- A hierarchical algorithm for making sparse matrices sparser
- An ILP based hierarchical global routing approach for VLSI ASIC design
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Presolving in linear programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(6)- The high precise/efficient pre/postprocessor
- VLSI circuit performance optimization by geometric programming
- Multilevel optimization in VLSICAD
- Preprocessing Steiner problems from VLSI layout
- An application of preconditioned conjugate gradients to relative placement in chip design
- Preprocessing for quadratic programming
This page was built for publication: Efficient preprocessing for VLSI optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967209)
