Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem (Q2706327): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:03, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem |
scientific article |
Statements
Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem (English)
0 references
19 March 2001
0 references
quadratic assignment problem
0 references
eigenvalue bounds
0 references
semidefinite programming
0 references
