On VLSI interconnect optimization and linear ordering problem
From MaRDI portal
Publication:2443401
Recommendations
- Using well-solvable quadratic assignment problems for VLSI interconnect applications
- The linear ordering problem with cumulative costs
- Optimal wire ordering and spacing in low power semiconductor design
- Algorithm for solving a problem on optimal linear ordering
- A new heuristic algorithm solving the linear ordering problem
Cites work
- An experimental evaluation of a scatter search for the linear ordering problem
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 1489805 (Why is no real title available?)
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- The complexity of VLSI power-delay optimization by interconnect resizing
- Variable neighborhood search for the linear ordering problem
Cited in
(6)- Performance optimization of VLSI interconnect layout
- scientific article; zbMATH DE number 2127785 (Why is no real title available?)
- Linear placement algorithms and applications to VLSI design
- Using well-solvable quadratic assignment problems for VLSI interconnect applications
- scientific article; zbMATH DE number 750011 (Why is no real title available?)
- Optimal wire ordering and spacing in low power semiconductor design
This page was built for publication: On VLSI interconnect optimization and linear ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443401)
