Using well-solvable quadratic assignment problems for VLSI interconnect applications

DOI10.1016/J.DAM.2011.11.017zbMATH Open1236.68013OpenAlexW2012738295MaRDI QIDQ412356FDOQ412356

Ben Emanuel, Shmuel Wimer, Gershon Wolansky

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.017

zbMATH Keywords

quadratic assignment problemtraveling salesman problem3D VLSInetworks on chipVLSI interconnects

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Extreme Hamiltonian lines
• Four point conditions and exponential neighborhoods for symmetric TSP
• Optimal wire ordering and spacing in low power semiconductor design
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices

Cited In (3)

• 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

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)