A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases (Q2835697)
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 6657828
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases |
scientific article; zbMATH DE number 6657828 |
Statements
A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (English)
0 references
30 November 2016
0 references
quadratic assignment
0 references
semidefinite programming
0 references
lower bound
0 references
branch and bound
0 references
0 references
0.8620270490646362
0 references
0.8481020331382751
0 references
0.8405919671058655
0 references
0.8288631439208984
0 references
