Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6030391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using well-solvable quadratic assignment problems for VLSI interconnect applications |
scientific article; zbMATH DE number 6030391 |
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
0 references
0 references
0.7395302057266235
0 references
0.7312712073326111
0 references
0.711750864982605
0 references
