Abstract
In this chapter we show a general compact extended formulation for the relaxation of the stable set polytope. For some graphs the stable set polytope can be given an exact representation, although with an exponential number of inequalities. When the graphs are perfect, however, compact extended formulations are possible for the stable set polytope. We give an example of such situation by describing a compact extended formulation, obtained by LP techniques, for the class of comparability graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Lancia, G., Serafini, P. (2018). Stable Sets. In: Compact Extended Linear Programming Models. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-319-63976-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-63976-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63975-8
Online ISBN: 978-3-319-63976-5
eBook Packages: Business and ManagementBusiness and Management (R0)