On the facets of the lift-and-project relaxations of graph subdivisions
From MaRDI portal
Publication:2840709
DOI10.1016/J.ENDM.2011.05.035zbMATH Open1268.05188OpenAlexW2055867321MaRDI QIDQ2840709FDOQ2840709
Authors: Néstor E. Aguilera, Pablo G. Fekete, Mariana S. Escalante 
Publication date: 23 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.2011.05.035
Recommendations
- On the facets of lift-and-project relaxations under graph operations
- Lift and project relaxations for the matching and related polytopes
- Lift-and-project cuts and perfect graphs
- On the linear relaxation of the 2-node connected subgraph polytope
- Lifting theorems and facet characterization for a class of clique partitioning inequalities
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- On the complexity of partitioning graphs into connected subgraphs
- Complexity of subdivision-vertex and subdivision-edge join graphs
- \(L(2,1)\)-labelings of subdivisions of graphs
Cites Work
- Cones of Matrices and Set-Functions and 0–1 Optimization
- The stable set problem and the lift-and-project ranks of graphs
- On the stable set polytope of a series-parallel graph
- Compositions of Graphs and Polyhedra II: Stable Sets
- On the polyhedral lift-and-project methods and the fractional stable set polytope
- Further facet generating procedures for vertex packing polytopes
- Critical facets of the stable set polytope
Cited In (3)
This page was built for publication: On the facets of the lift-and-project relaxations of graph subdivisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840709)
