Tighter representations for set partitioning problems

Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

Journal of Heuristics

A concurrent processing framework for the set partitioning problem

Computers and Operations Research

A Relax-and-Cut algorithm for the set partitioning problem

Computers and Operations Research

Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra

Discrete Applied Mathematics

Breaking the rectangle bound barrier against formula size lower bounds

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science

Note: On the polyhedral lift-and-project methods and the fractional stable set polytope

Discrete Optimization