Efficient points in the biobjective cent-dian problem (Q2704990)

Given an undirected network with vertex weights, edge lengths and costs, the cent-dian problem consists of determining one facility on the network which minimizes a given convex combination of the maximum distance and the sum of distances (i.e. a combination of the center function and the median function is considered). The same is required for the function based on the edge costs. For this biobjective problem, the authors suggest a polynomial algorithm running in \(O(|V||E|\log|V|)\) time based on computational geometry, which determines all efficient points. The authors give several computational results.