1. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
2. Arora , S. Lund , C. Motwani , R. Sudan , M. , and Szegedy , M . 1992. Proof verification and hardness of approximation problems. InProceedings 33rd IEEE Symposium on Foundations of Computer Sci., Pittsburgh, PA, pp.14-23.
3. A lift-and-project cutting plane algorithm for mixed 0–1 programs