Citation: Ay. Alfakih et al., Solving Euclidean distance matrix completion problems via semidefinite programming, COMPUT OP A, 12(1-3), 1999, pp. 13-30
Authors:
Anstreicher, K
Chen, X
Wolkowicz, H
Yuan, YX
Citation: K. Anstreicher et al., Strong duality for a trust-region type relaxation of the quadratic assignment problem, LIN ALG APP, 301(1-3), 1999, pp. 121-136