Now showing items 1-3 of 3
Robust facility location [Article]
Let A be a nonempty finite subset of the plane representing the geographical coordinates of a set of demand points (towns, …), to be served by a facility, whose location within a given region S is sought. Assuming that the ...
A unified approach to network location problems [Article]
(John Wiley and Sons, 1999)
In this paper we introduce a new type of single facility location problems on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set ...
Generalized goal programming: polynomial methods and applications [Article]
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations with respect to targets. In particular, ...