A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
Year of publication: |
2015
|
---|---|
Authors: | Klerk, Etienne de ; Sotirov, R. ; Truetsch, U. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 2, p. 378-391
|
Subject: | quadratic assignment problem | semidefinite programming bounds | branch and bound | convex relaxations | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Some results for quadratic problems with one or two quadratic constraints
Locatelli, Marco, (2015)
-
Convex relaxatrions for gas expansion planning
Borraz-Sánchez, Conrado, (2016)
-
Technical note: masking Anstreicher’s linx bound for improved entropy bounds
Chen, Zhongzhu, (2024)
- More ...
-
On the Lovász v-number of almost regular graphs with application to Erdös-Rényi graphs
Klerk, Etienne de, (2006)
-
Exploting group symmetry in truss topology optimization
Bai, Y.-Q., (2007)
-
A semidefinite programming based branch-and-bound framework for the quadratic assignment problem
Truetsch, U., (2014)
- More ...