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...

Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...

A covering array CA is a combinatorial structure specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns every t-tuple of symbols is covered at least once. Given the values of t, k, and v, the optimal covering array construction problem CAC consists in constructing a CA N; t, k, v with the minimum possible value of N. There are several rep...

In this paper we analyze a continuous version of the maximal covering location problem, in which facilities are required to be linked by means given graph structure (provided that two allowed if distance is not exceed). We propose mathematical programming framework for problem and different resolution strategies. First, provide Mixed Integer Non Linear Programming formulation derive some geomet...