![]() | Up a level |
Rocha, D., Aloise, D., Aloise, D. J., & Contardo, C. (2022). Visual attractiveness in vehicle routing via bi-objective optimization. Computers & Operations Research, 137, 105507 (14 pages). Restricted access
Randel, R., Aloise, D., Blanchard, S. J., & Hertz, A. (2021). A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering. Data Mining and Knowledge Discovery, 35(6), 2341-2368. Available
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]. 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2020), Vienna, Austria. Available
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), 613-630. Available
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), 153-169. Available
Aloise, D. (2009). Exact algorithms for minimum sum-of-squares clustering [Ph.D. thesis, École Polytechnique de Montréal]. Available