Using well-solvable quadratic assignment problems for VLSI interconnect applications
From MaRDI portal
(Redirected from Publication:412356)
Recommendations
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 2062231 (Why is no real title available?)
- Extreme Hamiltonian lines
- Four point conditions and exponential neighborhoods for symmetric TSP
- Optimal wire ordering and spacing in low power semiconductor design
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
Cited in
(4)- The quadratic assignment problem in the context of the printed circuit board assembly process
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization
- On VLSI interconnect optimization and linear ordering problem
This page was built for publication: Using well-solvable quadratic assignment problems for VLSI interconnect applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412356)