Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four point conditions and exponential neighborhoods for symmetric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal wire ordering and spacing in low power semiconductor design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459105 / rank
 
Normal rank

Latest revision as of 04:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Using well-solvable quadratic assignment problems for VLSI interconnect applications
scientific article

    Statements

    Using well-solvable quadratic assignment problems for VLSI interconnect applications (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    0 references
    quadratic assignment problem
    0 references
    traveling salesman problem
    0 references
    VLSI interconnects
    0 references
    networks on chip
    0 references
    3D VLSI
    0 references
    0 references