This paper addresses two problems, the inverse 1-center problem on the line with closed-
interval facilities and the inverse 1-center problem on R d. For the first problem, we develop …

We propose an O (n log p+ 2 n) algorithm for solving the well-known p-Median problem for
trees. Our analysis relies on the fact that p is considered constant (in practice, very often p<< …

The p-center problem is to locate p facilities in a network of n demand points so as to
minimize the longest distance between a demand point and its nearest facility. We consider …

Let G (V, E, w, l) denote an n-vertex and m-edge graph in which w is a function map**
each vertex v to a positive weight w (v) and l is a function map** each edge e to a positive …

The p-center problem is the problem of finding p best places on a network to locate facilities
for providing customers' demands such that the maximum distance between the demand …

In this paper we study a variant of the p-center problem on cactus graphs in which the p-
center are asked to be connected, and this problem is called the connected p-center …

Here we consider the p-center problem on different types of fuzzy networks. In particular, we
are interested in the networks with interval and triangular fuzzy arc lengths and vertex …

Let $ G $ be a bipartite graph. In this paper we consider the two kind of location problems
namely $ p $-center and $ p $-median problems on bipartite graphs. The $ p $-center and …

The traditional problems of facility location are defined statically; a set (or multiset) of n
points is given as input, corresponding to the positions of clients, and a solution is returned …

In the covering problems, the attempt is to determine the location of the minimum number of
facilities necessary to cover all demand nodes. In this type of problems, the coverage …