Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs
From MaRDI portal
Publication:3195330
DOI10.1007/978-3-319-09174-7_19zbMath1452.90310OpenAlexW109539244MaRDI QIDQ3195330
Graciela L. Nasini, Mariana S. Escalante
Publication date: 16 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_19
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (5)
Characterizing N+-perfect line graphs ⋮ Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs ⋮ Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs ⋮ On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets ⋮ Lovász-Schrijver PSD-Operator on Claw-Free Graphs
Cites Work
- The strong perfect graph theorem
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture
- The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- Near-perfect matrices
- On certain polytopes associated with graphs
- The stable set problem and the lift-and-project ranks of graphs
- Applying Lehman's theorems to packing problems
- Near-perfect graphs with polyhedral
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the Shannon capacity of a graph
- On the facial structure of set packing polyhedra
- Unnamed Item
This page was built for publication: Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs
