An exact CP approach for the cardinality-constrained Euclidean minimum sum-of-squares clustering problem

DOI10.1007/978-3-030-58942-4_17OpenAlexW3089750468MaRDI QIDQ2110413

Gilles Pesant, Mohammed Najib Haouas, Daniel Aloise

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-58942-4_17

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Related Items (1)

NP-hardness of Euclidean sum-of-squares clustering

This page was built for publication: An exact CP approach for the cardinality-constrained Euclidean minimum sum-of-squares clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2110413)