A new facet generating procedure for the stable set polytope
DOI10.1016/J.ENDM.2011.05.032zbMATH Open1268.05216OpenAlexW2070265150MaRDI QIDQ2840706FDOQ2840706
Authors: Álinson S. Xavier, Manoel Campêlo 
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.032
Recommendations
- A strengthened general cut-generating procedure for the stable set polytope
- General cut-generating procedures for the stable set polytope
- Generating facets for the independence system polytope
- On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
- Facet Obtaining Procedures for Set Packing Problems
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- A one-to-one correspondence between colorings and stable sets
- Facet Obtaining Procedures for Set Packing Problems
- Gear composition and the stable set polytope
- Compositions of Graphs and Polyhedra II: Stable Sets
- Further facet generating procedures for vertex packing polytopes
Cited In (13)
- A new lifting theorem for vertex packing
- Facet-generating procedures for the maximum-impact coloring polytope
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
- General cut-generating procedures for the stable set polytope
- Generating facets for the independence system polytope
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- On the combinatorics of the 2-class classification problem
- On the facets of lift-and-project relaxations under graph operations
- Facet Obtaining Procedures for Set Packing Problems
- A strengthened general cut-generating procedure for the stable set polytope
- Facets with fixed defect of the stable set polytope
- New facets for the set packing polytope
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets
This page was built for publication: A new facet generating procedure for the stable set polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840706)
