In this paper the following facility location problem in a mixed planar-network space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (A <Subscript> i </Subscript>,A <Subscript> j </Subscript>) is called covered if the time to...</subscript></subscript>

In this paper we consider the problem of locating an axis-parallel rectangle in the plane such that the sum of distances between the rectangle and a finite point set is minimized, where the distance is measured by the Manhattan norm ℓ <Subscript>1</Subscript>. In this way we solve an extension of the Weber problem...</subscript>

This paper presents a new concept of partial coverage distance, where demand points within a given threshold distance of a new facility are covered in the traditional sense, while non-covered demand points are penalized an amount proportional to their distance to the covered region. Two single...