Showing 1 - 10 of 19,496
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...
Persistent link: https://www.econbiz.de/10014116698
Persistent link: https://www.econbiz.de/10010247383
Persistent link: https://www.econbiz.de/10010487534
Persistent link: https://www.econbiz.de/10003668345
Persistent link: https://www.econbiz.de/10003668362
Persistent link: https://www.econbiz.de/10011341905
Persistent link: https://www.econbiz.de/10011697651
Persistent link: https://www.econbiz.de/10001298748
Persistent link: https://www.econbiz.de/10001302632
Persistent link: https://www.econbiz.de/10010194363