On the set covering polyhedron of circulant matrices

被引:16
作者
Argiroffo, Gabriela R. [1 ]
Bianchi, Silvia M. [1 ]
机构
[1] Univ Nacl Rosario, Dept Matemat, Fac Ciencias Exactas Ingn & Agrimensura, RA-2000 Rosario, Santa Fe, Argentina
关键词
Set covering polyhedron; Circulant matrix; Fractional extreme point; Non-Boolean facet; PERFECT; POLYTOPES; FACETS; GRAPHS; WEBS;
D O I
10.1016/j.disopt.2008.11.001
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A well known family of minimally nonideal matrices is the family of the incidence matrices of chordless odd cycles. A natural generalization of these matrices is given by the family of circulant matrices. Ideal and minimally nonideal circulant matrices have been completely identified by Cornuejols and Novick [G. Cornuejols. B. Novick, Ideal 0 - 1 matrices, Journal of Combinatorial Theory B 60 (1994) 145-157]. In this work we classify circulant matrices and their blockers in terms of the inequalities involved ill their set covering polyhedra. We exploit the results due to Cornuejols and Novick in the above-cited reference for describing the set covering polyhedron of blockers of circulant matrices. Finally, we point out that the results found on circulant matrices and their blockers present a remarkable analogy with a similar analysis of webs and antiwebs due to Pecher and Wagler [A. Pecher, A. Wagler. A construction for non-rank facets of stable set polytopes of webs, European Journal of Combinatorics 27 (2006) 1172-1185; A. Pecher, A. Wagler, Almost all webs are not rank-perfect, Mathematical Programming Series B 105 (2006) 311-328] and Wagler [A. Wagler, Relaxing perfectness: Which graphs are 'Almost' perfect?, in: A Groetschel (Ed.), The Sharpest Cut, Impact of Manfred Padberg and his work, in: SIAM/MPS Series on Optimization, vol. 4, Philadelphia, 2004; A.Wagler, Antiwebs are rank-perfect, 4OR 2 (2004) 149-152]. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:162 / 173
页数:12
相关论文
共 18 条
[1]  
ARGIROFFO G, 2005, THESIS U NACL ROSARI
[2]   On a certain class of nonideal clutters [J].
Argiroffo, Gabriela R. ;
Bianchi, Silvia M. ;
Nasini, Graciela L. .
DISCRETE APPLIED MATHEMATICS, 2006, 154 (13) :1854-1864
[3]   The strong perfect graph theorem [J].
Chudnovsky, Maria ;
Robertson, Neil ;
Seymour, Paul ;
Thomas, Robin .
ANNALS OF MATHEMATICS, 2006, 164 (01) :51-229
[4]   CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS [J].
CHVATAL, V .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (02) :138-154
[5]   IDEAL 0, 1 MATRICES [J].
CORNUEJOLS, G ;
NOVICK, B .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 60 (01) :145-157
[6]  
Lehman A., 1990, DIMACS Se. Discrete Math. Theoret. Comput. Sci., V1, P101
[7]   FACETS AND LIFTING PROCEDURES FOR THE SET COVERING POLYTOPE [J].
NOBILI, P ;
SASSANO, A .
MATHEMATICAL PROGRAMMING, 1989, 45 (01) :111-137
[8]  
PADBERG MW, 1976, LINEAR ALGEBRA ITS A, V15, P339
[9]  
PADBERG MW, 1993, DISCRETE MATH, V11, P409
[10]   Almost all webs are not rank-perfect [J].
Pêcher, A ;
Wagler, AK .
MATHEMATICAL PROGRAMMING, 2006, 105 (2-3) :311-328