Home > Research > Publications & Outputs > A new approach to the stable set problem based ...
View graph of relations

A new approach to the stable set problem based on ellipsoids

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter (peer-reviewed)peer-review

Published
Close
Publication date2011
Host publicationInteger Programming and Combinatorial Optimization : Proceedings of the 15th International IPCO Conference
EditorsOktay Günlük, Gerhard Woeginger
Place of PublicationBerlin
PublisherSpringer
Pages223-234
Number of pages12
ISBN (print)9783642208065
<mark>Original language</mark>English
Event15th International Conference, IPCO 2011 - New York, United States
Duration: 15/06/201117/06/2011

Conference

Conference15th International Conference, IPCO 2011
Country/TerritoryUnited States
CityNew York
Period15/06/1117/06/11

Publication series

NameLecture Notes in Computer Science
Volume6655

Conference

Conference15th International Conference, IPCO 2011
Country/TerritoryUnited States
CityNew York
Period15/06/1117/06/11

Abstract

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 Lovasz 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.