From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems

Frédéric Roupin. From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. J. Comb. Optim., 8(4):469-493, 2004. [doi]

Abstract

Abstract is missing.