Antiweb-wheel inequalities and their separation problems over the stable set polytopes
From MaRDI portal
Publication:1600099
DOI10.1007/s101070100267zbMath1154.90604OpenAlexW2090665905MaRDI QIDQ1600099
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Tree-width and the Sherali-Adams operator, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, Generating irreducible copositive matrices using the stable set problem, The stable set problem: clique and nodal inequalities revisited, Strong lift-and-project cutting planes for the stable set problem, Total coloring and total matching: polyhedra and facets, An extended formulation for the 1‐wheel inequalities of the stable set polytope, Separating multi-oddity constrained shortest circuits over the polytope of stable multisets., Facets from gadgets, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope, A tutorial on branch and cut algorithms for the maximum stable set problem, Strengthened clique-family inequalities for the stable set polytope, The wheels of the orthogonal Latin squares polytope: classification and valid inequalities
