We consider a discrete facility location problem where the difference between the maximum
and minimum number of customers allocated to every plant has to be balanced. Two …

We consider a discrete facility location problem with a new form of equity criterion. The
model discussed in the paper analyzes the case where demand points only have strict …

Abstract The Fermat–Weber problem is considered with distance defined by a quasimetric,
an asymmetric and possibly nondefinite generalisation of a metric. In such a situation a …

Multi-source Weber problem (MSWP) is a classical nonconvex and NP-hard model in facility
location. A well-known method for solving MSWP is the location–allocation algorithm which …

A Condorcet point, in voting location, is a location point such that there is no other closer to
more than half of the users. However, such Condorcet solution does not necessarily exist …

Abstract In the (r| p)-centroid problem, two players, called leader and follower, open facilities
to service clients. We assume that clients are identified with their location on the Euclidian …

We present a geometrical characterization of the efficient, weakly efficient and strictly
efficient points for multi-objective location problems in presence of convex constraints and …

In this paper, we consider constrained multicriteria continuous location problems in two-
dimensional spaces. In the literature, the continuous multicriteria location problem in two …

The classical multifacility Weber problem (MFWP) is one of the most important models in
facility location. This paper considers more general and practical case of MFWP called …

The well-known multi-facility Weber problem (MFWP) is one of fundamental models in facility
location. With the aim of enhancing the practical applicability of MFWP, this paper considers …