Row family inequalities for the set covering polyhedron-Reference-Cited by-同舟云学术

Row family inequalities for the set covering polyhedron

Published:2010-08 Issue: Volume:36 Page:1169-1176
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Argiroffo Gabriela R.,Bianchi Silvia M.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference17 articles.

1. Arithmetic relations in the set covering polyhedron of circulant clutters;Aguilera;Electronic Notes in Discrete Mathematics,2008

2. On the set covering polyhedron of circulant matrices;Argiroffo;Discrete Optimization,2009

3. On the set covering polytope: I. All the facets with coefficients in {0,1,2};Balas;Mathematical Programming,1989

4. E. Balas and E. Zemel, Critical cutsets of graphs and canonical facets of set packing polytopes, Mathematics of Operations Research 2 (1077), 15–19.

5. On the dominating set polytope of web graphs;Bianchi;Electronic Notes in Discrete Mathematics,2009

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On dominating set polyhedra of circular interval graphs;Discrete Mathematics;2021-04

2. On the Chvátal-rank of facets for the set covering polyhedron of circular matrices;Electronic Notes in Discrete Mathematics;2018-08

3. Generalized minor inequalities for the set covering polyhedron related to circulant matrices;Discrete Applied Mathematics;2016-09

4. Minor related row family inequalities for the set covering polyhedron of circulant matrices;Electronic Notes in Discrete Mathematics;2015-12