Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem (Q2706327): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: QAPLIB / rank | |||
Normal rank |
Revision as of 05:56, 28 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