Influence maximization aims at identifying a limited set of key individuals in (social) network which spreads information based on some propagation model and maximizes the number reached. We show that influence probabilistic independent cascade can be modeled as stochastic maximal covering location problem. A reformulation Benders decomposition is proposed relation between obtained optimality c...

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.