In this paper we analyze the extension of classical smallest enclosing disk problem to case location a polyellipsoid fully cover set demand points in Rd. We prove that is polynomially solvable fixed dimension and mathematical programming formulations for it. also consider some geometric approaches foci polyellipsoids are known. Extensions algorithm by Elzinga-Hearn derived new problem. Moreover...

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

In this paper, we consider the design of large-scale hub-and-spoke transportation networks in a competitive environment. We adopt the hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for passengers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm w...

The need to make effective plans for locating transportation hubs is of increasing importance in the megaregional area, as recent research suggests that growing intercity travel demand affects efficiency a system. This paper investigates hierarchical facility location problem passenger network. aim study determine locations hub facilities at different levels and distribute demands these with mi...