Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6399876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting |
scientific article; zbMATH DE number 6399876 |
Statements
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (English)
0 references
10 February 2015
0 references
quadratic assignment problem
0 references
semi-definite programming
0 references
semi-definite relaxation
0 references
matrix splitting
0 references
lower bound
0 references
0 references
0 references
0 references
0.9478582
0 references
0.93768066
0 references
0.9278293
0 references
0.92674476
0 references
0.9264459
0 references
0.9262423
0 references
0.9255593
0 references
