Book Sections Year : 2020

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

Domains

Computer Science [cs] Computational Complexity [cs.CC] Computational Geometry [cs.CG] Operations Research [math.OC]

Nicolas Dupin  : Connect in order to contact the contributor

https://hal.science/hal-02480379

Submitted on : Sunday, February 16, 2020-10:54:45 AM

Last modification on : Thursday, August 1, 2024-5:08:02 PM

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS INRIA LIX X-LIX X-DEP-INFO UMR8623 CENTRALESUPELEC CRISTAL INRIA2 LRI-ROCS TDS-MACS UNIV-PARIS-SACLAY CRISTAL-BONUS UNIV-LILLE IP_PARIS LISN GS-COMPUTER-SCIENCE GS-LIFE-SCIENCES-HEALTH LISN-ROCS
78 View
0 Download

Altmetric

Share

More