On the 0, 1 facets of the set covering polytope

A parallel genetic algorithm to solve the set-covering problem

Computers and Operations Research

Rank inequalities and separation algorithms for packing designs and sparse triple systems

Theoretical Computer Science - Latin American theoretical informatics

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

Computational experience with general cutting planes for the Set Covering problem

Operations Research Letters

Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities

Discrete Optimization

A Boolean theory of signatures for tonal scales

Discrete Applied Mathematics