A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases |
scientific article |
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
