Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6030391 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quadratic assignment problem | |||
Property / zbMATH Keywords: quadratic assignment problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
traveling salesman problem | |||
Property / zbMATH Keywords: traveling salesman problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
VLSI interconnects | |||
Property / zbMATH Keywords: VLSI interconnects / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
networks on chip | |||
Property / zbMATH Keywords: networks on chip / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
3D VLSI | |||
Property / zbMATH Keywords: 3D VLSI / rank | |||
Normal rank |
Revision as of 19:51, 29 June 2023
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
4 May 2012
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