Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QAPLIB / rank | |||
Normal rank | |||
Revision as of 07:55, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming approach for the quadratic assignment problem with a sparse graph |
scientific article |
Statements
Semidefinite programming approach for the quadratic assignment problem with a sparse graph (English)
0 references
20 April 2018
0 references
graph matching
0 references
quadratic assignment problem
0 references
convex relaxation
0 references
semidefinite programming
0 references
alternating direction method of multipliers
0 references
