scientific article; zbMATH DE number 863499

zbMath0845.90103MaRDI QIDQ4871778

No author found.

Publication date: 16 September 1996

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

zbMATH Keywords

polyhedral combinatoricsbipartite, directed and perfect graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (8)

The facets and the symmetries of the approval-voting polytope ⋮ From approximate to exact integer programming ⋮ An optimal bound to access the core in TU-games ⋮ A short proof of a theorem of Falmagne. ⋮ The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization ⋮ The stable set polytope for some extensions of \(P_4\)-free graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Counting stable sets on Cartesian products of graphs

This page was built for publication: