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

A mixed binary integer linear program is formulated to determine the economic development of marginal groundwater sources at local demand sites in an arid region. These marginal sources are required to augment the supply from an overloaded regional source. The model accounts for variable costs...

This paper presents a new local search approach for solving continuous location problems. The main idea is to exploit the relation between the continuous model and its discrete counterpart. A local search is first conducted in the continuous space until a local optimum is reached. It then...

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

Measurements for fitting a given number of concentric circles are recorded. For each concentric circle several measurements are taken. The problem is to fit the given number of circles to the data such that all circles have a common center. This is a generalization of the problem of fitting a...

This paper presents a general mixed-norm minisum problem for locating a single facility in continuous space. It is assumed that several transportation modes exist between the new facility and a given set of fixed points (the customers), each mode being represented by a different ℓ p norm. A...