Antiweb-wheel inequalities and their separation problems over the stable set polytopes

DOI10.1007/s101070100267zbMath1154.90604MaRDI QIDQ1600099

Eddie Cheng, Sven de Vries

Publication date: 12 June 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100267

zbMATH Keywords

maximum weight stable set; antiweb-wheel inequalities.

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

A tutorial on branch and cut algorithms for the maximum stable set problem, Strong lift-and-project cutting planes for the stable set problem, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, Separating multi-oddity constrained shortest circuits over the polytope of stable multisets., Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope, Facets from gadgets, Tree-width and the Sherali-Adams operator, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, The wheels of the orthogonal Latin squares polytope: classification and valid inequalities, Generating irreducible copositive matrices using the stable set problem, The stable set problem: clique and nodal inequalities revisited