A new exact approach to the stable set problem is presented, which attempts to avoids the pitfalls of existing approaches based on linear and semidefinite programming. The method begins by constructing an ellipsoid that contains the stable set polytope and has the property that the upper bound obtained by optimising over it is equal to the Lovász theta number. This ellipsoid is then used to derive cutting planes, which can be used within a linear programming-based branch-and-cut algorithm. Preliminary computational results indicate that the cutting planes are strong and easy to generate. © 2011 Springer-Verlag.
Giandomenico, M., Letchford, A. N., Rossi, F., & Smriglio, S. (2011). A new approach to the stable set problem based on ellipsoids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6655 LNCS, pp. 223–234). https://doi.org/10.1007/978-3-642-20807-2_18