A Heuristic Algorithm for the Set Covering Problem

Bregman Proximal Relaxation of Large-Scale 0–1 Problems

Computational Optimization and Applications

An efficient heuristic approach to solve the unate covering problem

DATE '00 Proceedings of the conference on Design, automation and test in Europe

Constraint Programming Based Column Generation for Crew Assignment

Journal of Heuristics

An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling

Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight

Parallel randomized heuristics for the set covering problem

Practical parallel computing

Association rule based classifier built via direct enumeration, online pruning and genetic algorithm based rule decimation

AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications

The Optimal Diversity Management Problem

Operations Research

Efficient confident search in large review corpora

ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II

Hybrid optimization techniques for the workshift and rest assignment of nursing personnel

Artificial Intelligence in Medicine