scientific article

zbMath1274.90293MaRDI QIDQ2861537

No author found.

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001381

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph theory (05C99)

Related Items (1)

Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs

Cites Work

• Characterizing and bounding the imperfection ratio for some classes of graphs
• On certain polytopes associated with graphs
• Graph imperfection. I
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Clutter nonidealness
• Strength of facets for the set covering and set packing polyhedra on circulant matrices
• Comparing Imperfection Ratio and Imperfection Index for Graph Classes
• Cones of Matrices and Set-Functions and 0–1 Optimization
• A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

This page was built for publication: