On the facial structure of the set covering polytope dimensional linear programming

A parallel genetic algorithm to solve the set-covering problem

Computers and Operations Research

Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics

A branch-and-cut algorithm for graph coloring

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization

A Branch-and-Cut algorithm for graph coloring

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization

The nonidealness index of rank-ideal matrices

Discrete Applied Mathematics

Strong formulation for the spot 5 daily photograph scheduling problem

Journal of Combinatorial Optimization

Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research

Computational experience with general cutting planes for the Set Covering problem

Operations Research Letters

Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Discrete Optimization

On the set covering polyhedron of circulant matrices

Discrete Optimization

How to recycle your facets

Discrete Optimization

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