1. F. Alizadeh, Combinatorial optimization with interior point methods and semi-definite matrices, PhD thesis, University of Minnesota, Minneapolis, MN, 1991.
2. M. Bellare and P. Rogaway, “The complexity of approximating a nonlinear program,” Mathematical Programming 69 (1995) 429–442.
3. S. Benson Y. Ye and X. Zhang, “Solving large-scale sparse semidefinite programs for combinatorial optimization,” Working Paper, Computational and Applied Mathematics, The University of Iowa, Iowa City, IA 52242, 1997.
4. D. Bertsimas, C. Teo and R. Vohra, “On dependent randomized rounding algorithms,” Proc. 5th IPCO Conference (1996) 330–344.
5. D. Bertsimas, C. Teo and R. Vohra, “Nonlinear relaxations and improved randomized approximation algorithms for multicut problems,” Proc., nth IPCO Conference (1995) 29–39.