Showing results 62 to 81 of 235
< previous
next >
| Author(s) | Title | Issue Date | Appears in | Rank |
| Brimberg, Jack; Drezner, Zvi; Mladenović, Nenad ; Salhi, Said | Generating good starting solutions for the p-median problem in the plane | 1-Dec-2012 | Electronic Notes in Discrete Mathematics; 39; 225-232 | |
| Davidović, Tatjana ; Mladenović, Nenad | Genetic algorithms for multiprocessor scheduling problem with communication delays | 2001 | 10. kongres matematičara Jugoslavije; 321-324 | M60 |
| Consoli, Sergio; Darby-Dowman, Kenneth; Mladenović, Nenad ; Moreno Pérez, José Andrés | Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem | 16-Jul-2009 | European Journal of Operational Research; 196(2); 440-449 | M21 |
| Gainanov, Damir; Mladenović, Nenad ; Rasskazova, Varvara; Urošević, Dragan | Heuristic algorithm for finding the maximum independent set with absolute estimate of the accuracy | 1-Jan-2018 | CEUR Workshop Proceedings; 2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018; Omsk; Russian Federation; 8 July 2018 through 14 July 2018; 2098; 141-149 | |
| Lawrance, Nareyus; Lucas, Cormac; Mladenović, Nenad | A heuristic hybrid framework for vector job scheduling | 1-Jan-2017 | Yugoslav Journal of Operations Research; 27(1); 31-45 | M51 |
| Domínguez-Marín, Patricia; Nickel, Stefan; Hansen, Pierre; Mladenović, Nenad | Heuristic procedures for solving the discrete ordered median problem | 1-Jan-2005 | Annals of Operations Research; 136(1); 145-173 | M22 |
| Hansen, Pierre; Mladenović, Nenad ; Taillard, Éric | Heuristic solution of the multisource Weber problem as a p-median problem | 1-Mar-1998 | Operations Research Letters; 22(2-3); 55-62 | M22 |
| Roksandić, Sanja; Urošević, Dragan ; Mladenović, Nenad ; Davidović, Tatjana ; Carrizosa, Emilio | Huff Location Model of the Bicycle Parking Services | 2011 | REACT 2011 Shaping Climate Friendly Transport in Europe: Key Findings and Future Directions; 270-275 | M30 |
| Ognjanović, Zoran ; Midić, Uroš; Mladenović, Nenad | A hybrid genetic and variable neighborhood descent for probabilistic SAT problem | 1-Jan-2005 | Lecture Notes in Computer Science; Second International Worshop on Hybrid Metaheuristics, HM 2005; Barcelona; Spain; 29 August 2005 through 30 August 2005; 3636; 42-53 | M22 |
| Coelho, Vitor Nazário; Coelho, Igor Machado; Souza, Marcone Jamilson Freitas; Oliveira, Thays; Cota, Luciano Perdigão; Haddad, Matheus Nohra; Mladenović, Nenad ; Silva, Rodrigo; Guimarães, Frederico Gadelha | Hybrid self-adaptive evolution strategies guided by neighborhood structures for combinatorial optimization problems | 1-Dec-2016 | Evolutionary Computation; 24(4); 637-666 | M21a |
| 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 |
