Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Semidefinite programming approach for the quadratic assignment problem with a sparse graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0.9315527
0 references
0.92097086
0 references
0.91814655
0 references
0.91346824
0 references
0.9106736
0 references
0.9032585
0 references
0.9026037
0 references
0.89920473
0 references
