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

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>

In this paper, we argue that a better information system is unlikely to solve the problem of lapsed funding that characterizes many government departments. This result is shown to depend critically on the nature of government costs.

We present a new general variable neighborhood search approach for the uncapacitated single allocation p-hub median problem in networks. This NP hard problem is concerned with locating hub facilities in order to minimize the traffic between all origin-destination pairs. We use three...