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

It is difficult to maintain the exact location of mobile objects due to the limited resources in a mobile network. A consequence of this problem is that the update cost for a location-dependent continuous query for moving objects can be quite high using traditional methods. In this paper, we propose a probabilistic update method to maintain the fidelity of the query results without incurring si...

We consider a continuous facility location problem in which our objective is to minimize the weighted sum of three costs: fixed costs from installing the facilities, backbone network costs incurred from connecting the facilities to each other, and transportation costs incurred from providing services from the facilities to the service region. We first analyze the limiting behavior of this model...

This article presents a simple model to determine the location strategies of two retail firms planning to open a number of stores in a geographical market. Firms try to maximize their profit under a leader-follower type competition in which the number of stores is made endogenous by the introduction of fixed costs. A novel methodology is developed, in which firms’ strategies are defined in term...