Giandomenico, M and Letchford, A N and Rossi, F and Smriglio, S (2011) A new approach to the stable set problem based on ellipsoids. Working Paper. The Department of Management Science, Lancaster University.
Full text not available from this repository.Abstract
We present a new exact approach to the stable set problem, which avoids the pitfalls of existing approaches based on linear and semidefinite programming. The main idea is to construct an ellipsoid which contains the stable set polytope, in such a way that the upper bound obtained by optimising over the ellipsoid is equal to the Lovasz theta number. This ellipsoid can then be used to construct useful convex programming relaxations of the stable set problem or, more interestingly, to derive cutting planes. These cutting planes turn out to be remarkably strong and easy to generate.