Cutting Planes for Mixed 0-1 Semidefinite Programs

A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)

Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science

Cone-LP's and Semidefinite Programs: Geometry

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization

Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization