Showing results 72 to 91 of 235
< previous
next >
| Author(s) | Title | Issue Date | Appears in | Rank |
| Hanafi, Saïd; Lazić, Jasmina; Mladenović, Nenad ; Wilbaut, Christophe; Crévits, Igor | Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem | 1-Aug-2010 | Electronic Notes in Discrete Mathematics; 36(C); 883-890 | |
| Melián, Belén; Mladenović, Nenad | IMA Journal Management Mathematics: Editorial | 1-Jan-2007 | IMA Journal of Management Mathematics; 18(2); 99-100 | |
| 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 |
| Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad ; Taillard, Eric | Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem | 1-Jan-2000 | Operations Research; 48(3); 444-460 | M21a |
| Macedo, Rita; Ramos, Bruna; Alves, Cláudio; de carvalho, José Valério; Hanafi, Saïd; Mladenović, Nenad | Integer programming based approaches for multi-trip location routing | 1-Jan-2016 | Computational Management Science; 682; 79-90 | |
| Consoli, Sergio; Moreno Pérez, José Andrés; Mladenović, Nenad | Intelligent optimization for the minimum labelling spanning tree problem | 30-Dec-2013 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 7th International Conference on Learning and Intelligent Optimization, LION 7; Catania; Italy; 7 January 2013 through 11 January 2013; 7997 LNCS; 19-23 | |
| Consoli, Sergio; Moreno Pérez, José Andrés; Mladenović, Nenad | Intelligent variable neighbourhood search for the minimum labelling spanning tree problem | 9-Jul-2013 | Electronic Notes in Discrete Mathematics; 41; 399-406 | |
| Du Merle, Olivier; Hansen, Pierre; Jaumard, Brigitte; Mladenović, Nenad | An interior point algorithm for minimum sum-of-squares clustering | 1-Jan-1999 | SIAM Journal of Scientific Computing; 21(4); 1485-1505 | M21a |
| Coelho, I. M.; Rios, E.; Silva, M. M.; Urošević, Dragan ; Mladenović, Nenad | Iterated VND and GVNS for Traveling Repairman Problem: head to head comparison | 2016 | 4th International Conference on VNS; 27-27 | M30 |
| Nikolaev, Alexey; Mladenović, Nenad ; Todosijević, Raca | J-means and I-means for minimum sum-of-squares clustering on networks | 1-Feb-2017 | Optimization Letters; 11(2); 359-376 | M21 |
| Hansen, Pierre; Mladenović, Nenad | J-Means: a new local search heuristic for minimum sum of squares clustering | 1-Jan-2001 | Pattern Recognition; 34(2); 405-413 | M21 |
| Nikolić, Nebojša; Grujičić, Igor; Mladenović, Nenad | A large neighbourhood search heuristic for covering designs | 1-Jan-2016 | IMA Journal of Management Mathematics; 27(1); 89-106 | M22 |
| Mladenović, Nenad ; Drezner, Zvi; Brimberg, Jack; Urošević, Dragan | Less Is More Approach in Heuristic Optimization | 2022 | The Palgrave Handbook of Operations Research; 469-499 | |
| Mladenović, Nenad ; Pei, Jun; Pardalos, Panos M.; Urošević, Dragan | Less is more approach in optimization: a road to artificial intelligence | 2022 | Optimization Letters; 16; 409-420 | M22 |
| Mladenović, Nenad ; Alkandari, Abdulaziz; Pei, Jun; Todosijević, Raca ; Pardalos, Panos | Less is more approach: basic variable neighborhood search for the obnoxious p-median problem | 1-Jan-2020 | International Transactions in Operational Research; 27(1); 480-493 | M21 |
| Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | Less is more: Basic variable neighborhood search for minimum differential dispersion problem | 1-Jan-2016 | Information Sciences; 326; 160-171 | M21a |
| 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 |
| Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | Less is more: Solving the Max-Mean diversity problem with variable neighborhood search | 1-Mar-2017 | Information Sciences; 382-383; 179-200 | M21a |
| Urošević, Dragan ; Alghoul, Yiad Ibrahim Yousef; Amirgaliyeva, Zhazira; Mladenović, Nenad | Less is more: Tabu search for bipartite quadratic programming problem | 1-Jan-2019 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019; Ekaterinburg; Russian Federation; 11548 LNCS; 390-401 | M33 |
