The stable set polytope of quasi-line graphs
type: Item
instance of: scholarly article
title: The stable set polytope of quasi-line graphs
zbMATH Open document ID: 1246.05138
author: Friedrich Eisenbrand
author: Gianpaolo Oriolo
author: Gautier Stauffer
author: P. Ventura
published in: Combinatorica
publication date: 2008-10-21T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5355084
MaRDI profile type: Publication
full work available at URL: s00493-008-2244-x
OpenAlex ID: W2111363006
cites work: Q3056948
cites work: Q4737523
cites work: Cyclic Scheduling via Integer Programs with Circular Ones
cites work: On the separation of split cuts and related inequalities
cites work: Q3416248
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: On cutting-plane proofs in combinatorial optimization
cites work: Chvátal closures for mixed integer programming problems
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: On the membership problem for the elementary closure of a polyhedron
cites work: The rank facets of the stable set polytope for claw-free graphs
cites work: Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
cites work: On stable set polyhedra for K//(1,3)free graphs
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Geometric algorithms and combinatorial optimization
cites work: On Linear Characterizations of Combinatorial Optimization Problems
cites work: On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
cites work: Convex hull of the edges of a graph and near bipartite graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
cites work: Clique family inequalities for the stable set polytope of quasi-line graphs.
cites work: Q4234148
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
cites work: On Cutting Planes
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Applying Lehman's theorems to packing problems
DOI: 10.1007/S00493-008-2244-X
Recommended article: On the facets of the stable set polytope of quasi-line graphs
Recommended article: Clique family inequalities for the stable set polytope of quasi-line graphs.
Recommended article: The stable set polytope and some operations on graphs
Recommended article: Stable Set Polytopes for a Class of Circulant Graphs
Recommended article: Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Recommended article: On the stable set polytope of a series-parallel graph
Recommended article: The stable set polytope of icosahedral graphs
Recommended article: On the linear extension complexity of stable set polytopes for perfect graphs
Recommended article: Stability critical graphs and ranks facets of the stable set polytope
Recommended article: The stable set polytope for some extensions of \(P_4\)-free graphs
description: scientific article; zbMATH DE number 5355084