scientific article
From MaRDI portal
Publication:2861548
zbMath1274.05052MaRDI QIDQ2861548
Gabriela R. Argiroffo, Silvia M. Bianchi
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001496
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Related Items (3)
Generalized minor inequalities for the set covering polyhedron related to circulant matrices ⋮ Minor related row family inequalities for the set covering polyhedron of circulant matrices ⋮ On dominating set polyhedra of circular interval graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the set covering polyhedron of circulant matrices
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- Facets and lifting procedures for the set covering polytope
- Ideal 0, 1 matrices
- The rank facets of the stable set polytope for claw-free graphs
- On certain polytopes associated with graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- On the dominating set polytope
- On the dominating set polytope of web graphs
- Arithmetic relations in the set covering polyhedron of circulant clutters
- On the facial structure of set packing polyhedra
This page was built for publication:
