The Set Covering Problem SCP is a main model for several important applications including crew scheduling in railway and mass transit companies In this survey we focus our attention on the most recent and e ective algo rithms for SCP considering both heuristic and exact approaches outlining their main characteristics and presenting an experimental comparison on the test bed instances of Beasley...

This paper proposes a greedy algorithm named as Big step greedy set cover algorithm to compute approximate minimum set cover. The Big step greedy algorithm, in each step selects p sets such that the union of selected p sets contains greatest number of uncovered elements and adds the selected p sets to partial set cover. The process of adding p sets is repeated until all the elements are covered...

We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning. We show that the problem is approximable within ratio (1+2)(e/e−1)H(q), where q is the maxi...