Journal of Combinatorial Theory Series B
Mathematical Programming: Series A and B
Applying Lehman's theorems to packing problems
Mathematical Programming: Series A and B
On a certain class of nonideal clutters
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Note: Notes on “Ideal 0, 1 matrices” by Cornuéjols and Novick
Journal of Combinatorial Theory Series B
Note: Facet-inducing web and antiweb inequalities for the graph coloring polytope
Discrete Applied Mathematics
Lift-and-project ranks of the set covering polytope of circulant matrices
Discrete Applied Mathematics
Some advances on the set covering polyhedron of circulant matrices
Discrete Applied Mathematics
| Hi-index | 0.04 |
Building on work by G. Cornuejols and B. Novick and by L. Trotter, we give different characterizations of contractions of consecutive ones circulant clutters that give back consecutive ones circulant clutters. Based on a recent result by G. Argiroffo and S. Bianchi, we then arrive at characterizations of the vertices of the fractional set covering polyhedron of these clutters. We obtain similar characterizations for the fractional set packing polyhedron using a result by F.B. Shepherd, and relate our findings with similar ones obtained by A. Wagler for the clique relaxation of the stable set polytope of webs. Finally, we show how our results can be used to obtain some old and new results on the corresponding fractional set covering polyhedron using properties of Farey series. Our results do not depend on Lehman's work or blocker/antiblocker duality, as is traditional in the field.