scientific article

zbMath1274.90448MaRDI QIDQ2861550

No author found.

Publication date: 8 November 2013

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A polyhedral view to a generalization of multiple domination ⋮ The minor inequalities in the description of the set covering polyhedron of circulant matrices ⋮ Unnamed Item ⋮ On \(f\)-domination: polyhedral and algorithmic results

Cites Work

• Unnamed Item
• On the set covering polyhedron of circulant matrices
• On the facial structure of the set covering polytope
• Ideal 0, 1 matrices
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On the dominating set polytope
• On the dominating set polytope of web graphs
• Arithmetic relations in the set covering polyhedron of circulant clutters

This page was built for publication: