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

The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...

Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different trans...

With the rapid increase in international roaming and highly growing number of cellular subscribers it is important to locate the subscriber both efficiently and accurately not only to reduce the cost but also to decrease the load on MSC and decrease the paging delay. The procedure used by the service provider for both collecting and analyzing the information regarding the subscribers’ location ...

We present an interactive visualization system for exploring the coverage in sensor networks with uncertain sensor locations. We consider a simple case of uncertainty where the location of each sensor is confined to a discrete number of points sampled uniformly at random from a region with a fixed radius. Employing techniques from topological data analysis, we model and visualize network covera...

Relative location information is very useful in vehicular networks although it is vulnerable to various attacks. Many techniques have been proposed for relative positioning and location verification. Due to the high speed and the strict security requirements, the existing relative positioning and location verification techniques are not directly applicable to vehicular networks. Hence we presen...

In this paper network location problems with several objectives are discussed, where every single objective is a classical median objective function. We will look at the problem of nding Pareto optimal locations and lexicographically optimal locations. It is shown that for Pareto optimal locations in undirected networks no node dominance result can be shown. Structural results as well as eecien...

We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined. This problem is known to be NPComplete for general graph. The problem remains NPComplete even when the vertices of the network are required to lie on the boundary of a convex polygon in the Euclidean plane. We present...