![]() | Up a level |
Haouas, M. N., Aloise, D. & Pesant, G. (2020, September). An exact CP approach for the cardinality-constrained euclidean minimum sum-of-squares clustering problem. Paper presented at 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2020), Vienna, Austria.
Aloise, D. (2009). Exact algorithms for minimum sum-of-squares clustering. (PhD thesis, École Polytechnique de Montréal).
Aloise, D. & Contardo, C. (2018). A sampling-based exact algorithm for the solution of the minimax diameter clustering problem. Journal of Global Optimization, 71(3), p. 613-630.
Gonçalves-e-Silva, K., Aloise, D., Xavier-De-Souza, S. & Mladenović, N. (2018). Less is more: simplified Nelder-Mead method for large unconstrained optimization. Yugoslav Journal of Operations Research, 28(2), p. 153-169.