Chapitre d'ouvrage, ROCS, Computer Science, Operations Research, Recherche opérationnelle

Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time

Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi. Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time. Optimization and Learning, pp.179-191, 2020, ⟨10.1007/978-3-030-41913-4_15⟩. ⟨hal-02480379⟩

Published on