Strengthened clique-family inequalities for the stable set polytope
type: Item
instance of: scholarly article
title: Strengthened clique-family inequalities for the stable set polytope
author: Adam N. Letchford
author: P. Ventura
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 05-XX
zbMATH DE Number: 7443064
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: stable set problem
zbMATH Keywords: polyhedral combinatorics
MaRDI profile type: Publication
full work available at URL: j.orl.2021.06.008
OpenAlex ID: W3170760983
cites work: Conflict graphs in solving integer programming problems
cites work: Q3145799
cites work: Set packing relaxations of some integer programs
cites work: Wheel inequalities for stable set polytopes
cites work: Antiweb-wheel inequalities and their separation problems over the stable set polytopes
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: On certain polytopes associated with graphs
cites work: MIR closures of polyhedral sets
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: The stable set polytope of quasi-line graphs
cites work: Gear composition and the stable set polytope
cites work: The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
cites work: The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
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: Geometric algorithms and combinatorial optimization
cites work: Q4263714
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs
cites work: Clique family inequalities for the stable set polytope of quasi-line graphs.
cites work: On the facial structure of set packing polyhedra
cites work: The maximum clique problem
cites work: Generalized clique family inequalities for claw-free graphs
cites work: A note on the Chvátal-rank of clique family inequalities
cites work: A branch and cut solver for the maximum stable set problem
cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem
cites work: A class of facet producing graphs for vertex packing polyhedra
DOI: 10.1016/J.ORL.2021.06.008
description: scientific article; zbMATH DE number 7443064