A smaller extended formulation for the odd cycle inequalities of the stable set polytope

DOI10.1016/j.dam.2020.10.006zbMath1477.90082OpenAlexW3095380845MaRDI QIDQ1983107

Sven de Vries, Bernd Perscheid

Publication date: 15 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.10.006

zbMATH Keywords

linear programmingstable setseparation algorithmextended formulationodd cycle inequalities

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Minimum weight clustered dominating tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Expressing combinatorial optimization problems by linear programs
• Geometric algorithms and combinatorial optimization
• On certain polytopes associated with graphs
• On the facial structure of set packing polyhedra
• An extended formulation for the 1‐wheel inequalities of the stable set polytope