The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs-Reference-Cited by-同舟云学术

The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs

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

Author:

Bianchi S.,Nasini G.,Tolomei P.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference9 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. A lift-and-project cutting plane algorithm for mixed 0-1 programs;Balas;Mathematical Programming,1993

4. Bianchi, S. and M. Escalante, The N-rank of circulant matrices, Proceedings of VI ALIO/EURO Workshop on Applied Combinatorial Optimization (2008), ISBN: 978-950-29-1116-8. http://combinatoria.fceia.unr.edu.ar/pdf/NrankBE.pdf

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

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

1. A polyhedral view to a generalization of multiple domination;Discrete Applied Mathematics;2022-05

2. On f-domination: polyhedral and algorithmic results;Mathematical Methods of Operations Research;2018-10-20

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

4. A Polyhedral View to Generalized Multiple Domination and Limited Packing;Lecture Notes in Computer Science;2018

5. The minor inequalities in the description of the set covering polyhedron of circulant matrices;Mathematical Methods of Operations Research;2013-09-08