Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming (Q3083337): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CVX / rank | |||
Normal rank | |||
Revision as of 01:37, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming |
scientific article |
Statements
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming (English)
0 references
21 March 2011
0 references
quadratic assignment problem
0 references
semidefinite programming
0 references
singular value decomposition
0 references
relaxation
0 references
lower bound
0 references
