On the set covering polyhedron of circulant matrices

G. Argiroffo, Clasificación de clutters no ideales, Ph.D. Dissertation, Universidad Nacional de Rosario, Argentina, 2005 Argiroffo, 2006, On a certain class of nonideal clutters, Discrete Applied Mathematics, 154, 1854, 10.1016/j.dam.2006.03.027 Chudnovsky, 2006, The strong perfect graph theorem, Annals of Mathematics, 164, 51, 10.4007/annals.2006.164.51 Chvátal, 1975, On certain polytopes associated with graphs, Journal of Combinatorial Theory series (B), 18, 138, 10.1016/0095-8956(75)90041-6 Cornuéjols, 2001, Combinatorial Optimization: Packing and Covering, vol. 74 Cornuéjols, 1994, Ideal 0−1 matrices, Journal of Combinatorial Theory series B, 60, 145, 10.1006/jctb.1994.1009 Fulkerson, 1970, Blocking polyhedra, 93 Lehman, 1979, On the width–length inequality, Mathematical Programming, 17, 403, 10.1007/BF01588263 Lehman, 1990, On the width–length inequality and degenerate projective planes, vol. 1, 101 Nobili, 1989, Facets and lifting procedures for the set covering polytope, Mathematical Programming, 45, 111, 10.1007/BF01589100 Padberg, 1976, Almost integral polyhedra related to certain combinatorial optimization problems, Linear Algebra and its Applications, 15, 339, 10.1016/0024-3795(76)90079-3 Padberg, 1993, Lehman’s forbidden minor characterization of ideal 0-1 matrices, Discrete Mathematics, 11, 409, 10.1016/0012-365X(93)90178-V Pêcher, 2006, A construction for non-rank facets of stable set polytopes of webs, European Journal of Combinatorics, 27, 1172, 10.1016/j.ejc.2006.06.013 Pêcher, 2006, Almost all webs are not rank-perfect, Mathematical Programming Series B, 105, 311, 10.1007/s10107-005-0655-7 PORTA: www.iwr.uni-heidelberg.de/groups/comopt/software/PORTA Sassano, 1989, On the facial structure of the set covering polytope, Mathematical Programming, 44, 181, 10.1007/BF01587087 Seymour, 1977, The matroids with the Max-Flow Min-Cut Property, Journal of Combinatorial Theory Series B, 23, 189, 10.1016/0095-8956(77)90031-4 Shepherd, 1994, Near-perfect matrices, Mathematical Programming, 64, 295, 10.1007/BF01582578 Trotter, 1975, A class of facets producing graphs for vertex packing polyhedra, Discrete Mathematics, 12, 373, 10.1016/0012-365X(75)90077-1 A. Wagler, Relaxing perfectness: Which graphs are ‘Almost’ perfect?, in: M. Groetschel (Ed.), The Sharpest Cut, Impact of Manfred Padberg and his work, in: SIAM/MPS Series on Optimization, vol. 4, Philadelphia, 2004 Wagler, 2004, Antiwebs are rank-perfect, 4OR, 2, 149, 10.1007/s10288-003-0032-4 A. Wagler, Beyond perfection: On relaxations and superclasses, Habilitation Thesis, Otto-von-Guericke-University Magdeburg, 2007