Finger, Markus; Stutzle, Thomas; Ramalhinho Dias … - 2002
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 search space characteristics of a widely used set of benchmark instances through...