Computational Experience with Stable Set Relaxations

Authors:
Gerald Gruber;Franz Rendl
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2002

Citing 0
Cited 4

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

Computational Optimization and Applications
Exploiting semidefinite relaxations in constraint programming

Computers and Operations Research
A Branch and Cut solver for the maximum stable set problem

Journal of Combinatorial Optimization
A new approach to the stable set problem based on ellipsoids

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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