Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Book Sections Year : 2020
No file

Dates and versions

hal-02480379 , version 1 (16-02-2020)

Identifiers

Cite

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⟩
60 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More