COMPUTATIONAL EXPERIENCE WITH STABLE SET RELAXATIONS.

We investigate relaxations for the maximum stable set problem based on the Lovász number v(G) as an initial upper bound. We strengthen this relaxation by adding two classes of curling planes, odd circuit and triangle inequalities. We present computational results using this tighter model on many classes of graphs. [ABSTRACT FROM AUTHOR]