k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front

Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi

This paper examines a common extension of k-medoids and k-median clustering in the case of a two-dimensional Pareto front, as generated by bi-objective optimization approaches. A c…