scientific article; zbMATH DE number 956849

zbMath0864.90122MaRDI QIDQ5687256

Antonio Sassano, Carlo Mannino

Publication date: 9 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-boundsparse graphsclique projectionmaximum cardinality stable set problemedge projection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Chair-free Berge graphs are perfect, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, Strong lift-and-project cutting planes for the stable set problem, Solving hard set covering problems, Maximum weight perfect matching problem with additional disjunctive conflict constraints, Struction revisited, Stability preserving transformations of graphs, A branch and cut solver for the maximum stable set problem, Fixed cardinality stable sets, A tutorial on branch and cut algorithms for the maximum stable set problem, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope, Routing trains through a railway station based on a node packing model