Showing results 5 to 24 of 237
< previous
next >
Author(s) | Title | Issue Date | Appears in | Rank |
Plotnikov, Roman; Erzin, Adil; Mladenović, Nenad | Approximation algorithms for the min-power symmetric connectivity problem | 20-Oct-2016 | AIP Conference Proceedings; 1776 | |
Džamić, Dušan; Aloise, Daniel; Mladenović, Nenad | Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization | 1-Jan-2019 | Annals of Operations Research; 272(1-2); 273-287 | M22 |
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad | Attraction probabilities in variable neighborhood search | 1-Jan-2010 | 4OR : A Quarterly Journal of Operations Research; 8(2); 181-194 | M23 |
Ristić, Dalibor; Mladenović, Nenad ; Ratli, Mustapha; Todosijević, Raca ; Urošević, Dragan | Auxiliary data structures and techniques to speed up solving of the p-next center problem: A VNS heuristic | 2023 | Applied Soft Computing; 140; 110276 | ~M21a |
Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem | 1-Feb-2017 | Optimization Letters; 11(2); 313-327 | M21 |
Urošević, Dragan ; Mladenović, Nenad | Basic VNS for the k-cardinality tree problem on the graph | 2001 | 10th congress of Yugoslav mathematicians; 21-24 | M60 |
Mladenović, Nenad ; Moreno, Jose; Moreno-Vega, J. Marcos | Chain-interchange heuristic method | 1-Jan-1996 | Yugoslav Journal of Operations Research; 6(1); 41-54 | |
Đorić, Danijela; El Cadi, Abdessamad Ait; Hanafi, Saïd; Mladenović, Nenad ; Artiba, Abdelhakim | Clustering approach in maintenance of capillary railway network | 1-Apr-2017 | Electronic Notes in Discrete Mathematics; 58; 239-246 | |
Zhikharevich, Boris; Rusetskay, O. V.; Mladenović, Nenad | Clustering cities based on their development dynamics and variable neigborhood search | 1-Jan-2015 | Electronic Notes in Discrete Mathematics; 47; 213-220 | |
Consoli, Sergio; Moreno Pérez, José Andrés; Mladenović, Nenad | Comparison of metaheuristics for the k-labeled spanning forest problem | 1-May-2017 | International Transactions in Operational Research; 24(3); 559-582 | M21 |
Janićijević, Stefana; Urošević, Dragan ; Mladenović, Nenad | Comparison of SAS/STAT procedures and variable neighborhood search based clustering applied on Telekom Serbia data | 4-May-2015 | Social Sciences Via Network Analysis and Computation; 79-88 | |
Hansen, Pierre; Mladenović, Nenad | Complement to a comparative analysis of heuristics for the p-median problem | 1-Mar-2008 | Statistics and Computing; 18(1); 41-46 | M21 |
Pei, Jun; Dražić, Zorica; Dražić, Milan; Mladenović, Nenad ; Pardalos, Panos | Continuous variable neighborhood search (C-VNS) for solving systems of nonlinear equations | 1-Jan-2019 | INFORMS Journal on Computing; 31(2); 235-250 | M22 |
Dražić, Milan; Lavor, Carlile; Maculan, Nelson; Mladenović, Nenad | A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule | 16-Mar-2008 | European Journal of Operational Research; 185(3); 1265-1273 | M21 |
Dražić, Milan; Dražić, Zorica; Mladenović, Nenad ; Urošević, Dragan ; Zhao, Qiu Hong | Continuous variable neighbourhood search with modified Nelder-Mead for non-differentiable optimization | 1-Jan-2016 | IMA Journal of Management Mathematics; 27(1); 75-88 | M23 |
Crainic, Teodor Gabriel; Gendreau, Michel; Hansen, Pierre; Mladenović, Nenad | Cooperative parallel variable neighborhood search for the p-median | 1-Jan-2004 | Journal of Heuristics; 10(3); 293-314 | M22 |
Kovačević, Darko; Mladenović, Nenad ; Petrović, Bratislav; Milošević, Pavle | DE-VNS: Self-adaptive Differential Evolution with crossover neighborhood search for continuous global optimization | 1-Dec-2014 | Computers and Operations Research; 52; 157-169 | M21 |
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad | Decomposition strategies for large-scale continuous location-allocation problems | 1-Jan-2006 | IMA Journal of Management Mathematics; 17(4); 307-316 | |
Brimberg, Jack; Mladenović, Nenad | Degeneracy in the multi-source Weber problem | 1-Jan-1999 | Mathematical Programming, Series B; 85(1); 213-220 | M21a |
Mladenović, Nenad ; Brimberg, Jack | Descent-ascent technique for solving the multi-source Weber problem | 1-Dec-1995 | Yugoslav Journal of Operations Research; 5(2); 211-219 | |