Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem (Q2706327): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QAPLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:07, 5 March 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
