The biobjective absolute center problem

This paper deals with the problem of determining the absolute center of a network, taking into account two objective functions. These functions consist of minimizing the maximum of the distances from any point on the network to the vertices, using two independent lengths on each edge. We propose an algorithm in polynomial time to obtain the non-dominated location points on the network, using the Kariv and Hakimi method.