Semidefinite Programming Relaxations for the Quadratic Assignment Problem
- 1 January 1998
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 2 (1) , 71-109
- https://doi.org/10.1023/a:1009795911987
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Lower bounds for the quadratic assignment problem via triangle decompositionsMathematical Programming, 1995
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic ObjectivesSIAM Journal on Optimization, 1993
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear ProgrammingSIAM Journal on Optimization, 1992
- Cones of Matrices and Set-Functions and 0–1 OptimizationSIAM Journal on Optimization, 1991