LP-oriented upper bounds for the weighted stability number of a graph

DOI10.1007/s10559-009-9070-zzbMath1197.05153OpenAlexW2048397201MaRDI QIDQ1040359

J. Blot

Publication date: 24 November 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9070-z

zbMATH Keywords

\(p\)-wheel\(t\)-perfect graph\(W_{p}\)-perfect graphLP-oriented upper boundpolyhedron of stable setsweighted stability number of a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• SCIP
• SoPlex
• DIMACS

Cites Work

• Geometric algorithms and combinatorial optimization
• Wheel inequalities for stable set polytopes
• Nondifferentiable optimization and polynomial problems
• Shortest paths algorithms: Theory and experimental evaluation
• Problems of discrete optimization: challenges and main approaches to solve them
• Unnamed Item

This page was built for publication: LP-oriented upper bounds for the weighted stability number of a graph