Showing results 2 to 8 of 8
< previous
| Author(s) | Title | Issue Date | Appears in | Rank |
| da Silva, Thiago Gouveia; de Sousa Filho, Gilberto; Barbosa, Igor; Mladenović, Nenad ; Cabral, Lucidio; Ochi, Luiz Satoru; Aloise, Daniel | Efficient heuristics for the minimum labeling global cut problem | 1-Apr-2018 | Electronic Notes in Discrete Mathematics; 66; 23-30 | |
| Mladenović, Nenad ; Aloise, Daniel; Urošević, Dragan ; Džamić, Dušan | Improved Variable Neighborhood Decomposition Search for Communitu Detection by Modularity Maximization | 2015 | XXXXII SYM-OP-IS; 15-18 | M30 |
| Costa, Leandro; Aloise, Daniel; Mladenović, Nenad | Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering | 1-Nov-2017 | Information Sciences; 415-416; 247-253 | M21a |
| Gonçalves-E-Silva, Kayo; Aloise, Daniel; Xavier-De-Souza, Samuel; Mladenović, Nenad | Less is more: Simplified nelder-mead method for large unconstrained optimization | 5-Jun-2018 | Yugoslav Journal of Operations Research; 28(2); 153-169 | M51 |
| Pyatkin, Artem; Aloise, Daniel; Mladenović, Nenad | NP-Hardness of balanced minimum sum-of-squares clustering | 1-Oct-2017 | Pattern Recognition Letters; 97; 44-45 | M22 |
| Aloise, Daniel; Damasceno, Nielsen Castelo; Mladenović, Nenad ; Pinheiro, Daniel Nobre | On Strategies to Fix Degenerate k-means Solutions | 1-Jul-2017 | Journal of Classification; 34(2); 165-190 | M21a |
| Randel, Rodrigo; Aloise, Daniel; Mladenović, Nenad ; Hansen, Pierre | On the k-Medoids Model for Semi-supervised Clustering | 1-Jan-2019 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 6th International Conference on Variable Neighborhood Search, ICVNS 2018; Sithonia; Greece; 4 October 2018 through 7 October 2018; 11328 LNCS; 13-27 | M33 |
