On the set covering polytope: I. all the facets with coefficients in {0, 1, 2}

A parallel genetic algorithm to solve the set-covering problem

Computers and Operations Research

Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Set covering approach for reconstruction of sibling relationships

Optimization Methods & Software - Systems Analysis, Optimization and Data Mining in Biomedicine

A comparison of formulations and solution methods for the minimum-envy location problem

Computers and Operations Research

Strong formulation for the spot 5 daily photograph scheduling problem

Journal of Combinatorial Optimization

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

How to recycle your facets

Discrete Optimization

Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron

Operations Research