Planar p-center problems are solvable in polynomial time when clustering a Pareto Front

Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi

This paper is motivated by real-life applications of bi-objective optimization. Having many non dominated solutions, one wishes to cluster the Pareto front using Euclidian distance…