Some advances on Lovász-Schrijver relaxations of the fractional stable set polytope

DOI10.1016/j.endm.2011.05.033zbMath1268.90130OpenAlexW1964124812MaRDI QIDQ2840707

Tunçel, Levent, Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini

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.033

zbMATH Keywords

semidefinite programmingstable set problemlift-and-project

Mathematics Subject Classification ID

Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope ⋮ Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs ⋮ Near-perfect graphs with polyhedral

Cites Work

• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Applying Lehman's theorems to packing problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Shannon capacity of a graph

This page was built for publication: Some advances on Lovász-Schrijver relaxations of the fractional stable set polytope