Finger, Markus; Stützle, Thomas; Ramalhinho-Lourenço, Helena
(2001-11-01)
The set covering problem is an NP-hard combinatorial optimization problem
that arises in applications ranging from crew scheduling in airlines to
driver scheduling in public mass transport. In this paper we analyze ...