A median of a sequence pi = x1, x2, … , xk of elements of a finite metric space (X, d ) is an element x for which ∑ k, i=1 d(x, xi) is minimum. The function M with domain the set of all finite sequences on X and defined by M(pi) = {x: x is a median of pi} is called the median function on X,...

The general problem in location theory deals with functions that find sites on a graph (discrete case) or network (continuous case) in such a way as to minimize some cost (or maximize some benefit) to a given set of clients represented by vertices on the graph or points on the network. The...

A profile = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of vertices of G, with repetitions allowed. A median x of is a vertex for which the sum of the distances from x to the vertices in the profile is minimum. The median function finds the set of all medians of a...

A mean of a sequence π = (x1, x2, . . . , xk) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean(π) = { x | x is a mean of π } is called the mean function on X. In this...

A median of a sequence ï° = x1, x2, … , xk of elements of a finite metric space (X, d ) is an element x for which  1 ≤ I ≤ k d(x, xi) is minimum. The function M with domain the set of all finite sequences on X and defined by M(ï°) = {x: x is a median of ï°} is...

A mean of a sequence π = (x1, x2, . . . , xk) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean(π) = { x | x is a mean of π } is called the mean function on...