Showing results 142 to 161 of 235
< previous
next >
| Author(s) | Title | Issue Date | Appears in | Rank |
| Hansen, Pierre; Mladenović, Nenad | A separable approximation dynamic programming algorithm for economic dispatch with transmission losses | 1-Jan-2002 | Yugoslav Journal of Operations Research; 12(2); 157-166 | |
| Mladenović, Nenad ; Hansen, Pierre; Brimberg, Jack | Sequential clustering with radius and split criteria | 1-Jun-2013 | Central European Journal of Operations Research; 21(SUPPL1); 95-115 | M23 |
| Mjirda, Anis; Todosijević, Raca ; Hanafi, Saïd; Hansen, Pierre; Mladenović, Nenad | Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem | 1-May-2017 | International Transactions in Operational Research; 24(3); 615-633 | M21 |
| Macedo, Rita; Alves, Cláudio; Hanafi, Saïd; Jarboui, Bassem; Mladenović, Nenad ; Ramos, Bruna; Valério De Carvalho, J. M. | Skewed general variable neighborhood search for the location routing scheduling problem | 1-Sep-2015 | Computers and Operations Research; 61; 143-152 | M21 |
| Coelho, Vitor; Coelho, Igor; Coelho, Bruno; Souza, Marcone J.F.; Gambini, Haroldo; Mladenović, Nenad ; Guimarães, Frederico | A Smart Pool Search Matheuristic for Solving a Multi-objective Microgrid Storage Planning Problem | 1-Dec-2016 | Energy Procedia; 103; 292-297 | |
| Lazić, Jasmina; Hanafi, Saïd; Mladenović, Nenad ; Urošević, Dragan | Solving 0-1 mixed integer programs with variable neighbourhood decomposition search | 1-Dec-2009 | IFAC Proceedings Volumes (IFAC-PapersOnline); 13th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'09; Moscow; Russian Federation; 3 June 2009 through 5 June 2009; 13(PART 1); 2012-2017 | |
| Hansen, Pierre; Brimberg, Jack; Urošević, Dragan ; Mladenović, Nenad | Solving large p-median clustering problems by primal-dual variable neighborhood search | 1-Dec-2009 | Data Mining and Knowledge Discovery; 19(3); 351-375 | M21a |
| Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | Solving Max-Mean Diversity Problem With General Variable Neighborhood Search | 2015 | XXXXII SYM-OP-IS; 121-124 | M30 |
| Roksandić, Sanja; Carrizosa, Emilio; Mladenović, Nenad ; Urošević, Dragan | Solving multifacility Huff location models on networks | 1-Jan-2013 | Proceedings of 2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013; 2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013; Rabat; Morocco; 28 October 2013 through 30 October 2013 | |
| Grohmann, Sanja; Urošević, Dragan ; Carrizosa, Emilio; Mladenović, Nenad | Solving multifacility Huff location models on networks using metaheuristic and exact approaches | 1-Feb-2017 | Computers and Operations Research; 78; 537-546 | M21 |
| Roksandić, Sanja; Carrizosa, Emilio; Urošević, Dragan ; Mladenović, Nenad | Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics | 1-Dec-2012 | Electronic Notes in Discrete Mathematics; 39; 121-128 | |
| Mladenović, Nenad ; Petrović, Jakov; Kovačević-Vujčić, Vera; Čangalović, Mirjana | Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search | 1-Dec-2003 | European Journal of Operational Research; 151(2); 389-399 | M22 |
| Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | Solving the capacitated clustering problem with variable neighborhood search | 1-Jan-2019 | Annals of Operations Research; 272(1-2); 289-321 | M22 |
| Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan ; Ratli, Mustapha | Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS | Mar-2022 | Computers and Operations Research; 139; 105622 | ~M21 |
| Brimberg, Jack; Janićijević, Stefana; Mladenović, Nenad ; Urošević, Dragan | Solving the clique partitioning problem as a maximally diverse grouping problem | 1-Aug-2017 | Optimization Letters; 11(6); 1123-1135 | M21 |
| Brimberg, Jack; Mladenović, Nenad ; Urošević, Dragan | Solving the maximally diverse grouping problem by skewed general variable neighborhood search | 1-Jan-2015 | Information Sciences; 295; 650-675 | M21a |
| Amirgaliyeva, Zhazira; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | Solving the maximum min-sum dispersion by alternating formulations of two different problems | 16-Jul-2017 | European Journal of Operational Research; 260(2); 444-459 | M21a |
| Consoli, Sergio; Mladenović, Nenad ; Moreno Pérez, José Andrés | Solving the minimum labelling spanning tree problem by intelligent optimization | 1-Jan-2015 | Applied Soft Computing Journal; 28; 440-452 | M21 |
| Mladenović, Nenad ; Labbé, Martine; Hansen, Pierre | Solving the p-Center Problem with Tabu Search and Variable Neighborhood Search | 1-Aug-2003 | Networks; 42(1); 48-64 | M22 |
| Ristic, Dalibor; Urošević, Dragan ; Mladenović, Nenad ; Todosijević, Raca | Solving the P-Second Center Problem with Variable Neighborhood Search | 1-Jan-2023 | Computer Science and Information Systems; 20(1); 95-115 | ~M23 |
