On different versions of the exact subgraph hierarchy for the stable set problem

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Semidefinite programming relaxations for graph coloring and maximal clique problems
Block-diagonal semidefinite programming hierarchies for 0/1 programming
The Boolean quadratic polytope: Some characteristics, facets and relatives
Geometric algorithms and combinatorial optimization
On the Lovász theta function and some variants
House of Graphs: a database of interesting graphs
Sparse PSD approximation of the PSD cone
A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
A bundle approach for SDPs with exact subgraph constraints
On extracting maximum stable sets in perfect graphs using Lovász's theta function
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
Integer Programming
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
A comparison of the Delsarte and Lovász bounds
Cones of Matrices and Set-Functions and 0–1 Optimization
On the Shannon capacity of a graph
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Computational Experience with Stable Set Relaxations
Fixing Variables in Semidefinite Relaxations
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Geometry of cuts and metrics
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems

This page was built for publication: On different versions of the exact subgraph hierarchy for the stable set problem