The Chvátal closure of generalized stable sets in bidirected graphs
From MaRDI portal
Publication:2840520
DOI10.1016/j.endm.2009.11.016zbMath1268.05123OpenAlexW1971789879MaRDI QIDQ2840520
Cornuéjols, Gérard, Manoel B. Campêlo
Publication date: 19 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.016
cutting planesChvátal closurecorner polyhedrasplit closurebidirected graphsedge-vertex incidence matrixfractional Gomory cuts
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- The stable set polytope of quasi-line graphs
- Matrices with the Edmonds-Johnson property
- Split closure and intersection cuts
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- A bidirected generalization of network matrices
This page was built for publication: The Chvátal closure of generalized stable sets in bidirected graphs