 | Monter d'un niveau |
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. Disponible
Da Silva, T. G., De Sousa Filho, G. F., Barbosa, I. A. M., Mladenovic, N., Cabral, L. A. F., Ochi, L. S., & Aloise, D. (2018). Efficient heuristics for the minimum labeling global cut problem. Electronic Notes in Discrete Mathematics, 66, 23-30. Lien externe
Gonçalves-e-Silva, K., Aloise, D., & Xavier-de-Souza, S. (2018). Parallel synchronous and asynchronous coupled simulated annealing. Journal of Supercomputing, 74(6), 2841-2869. Lien externe
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. Disponible
Hulot, P., Aloise, D., & Jena, S. D. (août 2018). Towards Station-Level Demand Prediction for Effective Rebalancing in Bike-Sharing Systems [Communication écrite]. 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, London, UK. Lien externe
Pereira, T., Aloise, D., Brimberg, J., & Mladenović, N. (2018). Review of Basic Local Searches for Solving the Minimum Sum-of-Squares Clustering Problem. Dans Pardalos, P. M., & Migdalas, A. (édit.), Open Problems in Optimization and Data Analysis (Vol. 141, 249-270). Lien externe
Pessoa, B. J. S., Aloise, D., & Cabral, L. A. F. (2018). The weighted fair sequences problem. Computers & Operations Research, 91, 121-131. Lien externe
