Showing results 31 to 50 of 65
< previous
next >
| Author(s) | Title | Issue Date | Appears in | Rank |
| Mladenović, Nenad ; Brimberg, Jack; Hansen, Pierre; Moreno-Pérez, José | The p-median problem: A survey of metaheuristic approaches | 16-Jun-2007 | European Journal of Operational Research; 179(3); 927-939 | M21 |
| Moreno Pérez, José A.; Hansen, Pierre; Mladenović, Nenad | Parallel Variable Neighborhood Search | 16-Sep-2005 | Parallel Metaheuristics: A New Class of Algorithms; 247-266 | |
| Davidović, Tatjana ; Hansen, Pierre; Mladenović, Nenad | Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays | 1-Jan-2005 | Asia-Pacific Journal of Operational Research; 22(3); 297-326 | M23 |
| Audet, Charles; Brimberg, Jack; Hansen, Pierre; Le Digabel, Sébastien; Mladenović, Nenad | Pooling problem: Alternate formulations and solution methods | 1-Jun-2004 | Management Science; 50(6); 761-776 | M21a |
| Hansen, Pierre; Brimberg, Jack; Urošević, Dragan ; Mladenović, Nenad | Primal-dual variable neighborhood search for the simple plant-location problem | 1-Jan-2007 | INFORMS Journal on Computing; 19(4); 552-564 | M21a |
| Davidović, Tatjana ; Hansen, Pierre; Mladenović, Nenad | Raspoređivanje metodom promenljivih okolina : eksperimentalna analiza | 2001 | XXVIII Simpozijum o operacionim istraživanjima, SYMOPIS 2001; 319-322 | M60 |
| Zhao, Qiu Hong; Urošević, Dragan ; Mladenović, Nenad ; Hansen, Pierre | A restarted and modified simplex search for unconstrained optimization | 1-Dec-2009 | Computers and Operations Research; 36(12); 3263-3271 | M21a |
| 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 |
| Aouchiche, Mustapha; Hansen, Pierre; Stevanović, Dragan | A sharp upper bound on algebraic connectivity using domination number | 1-Jun-2010 | Linear Algebra and Its Applications; 432(11); 2879-2893 | M22 |
| 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 |
| 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 |
| Hansen, Pierre; Mladenović, Nenad ; Perez-Britos, Dionisio | Variable neighborhood decomposition search | 1-Jul-2001 | Journal of Heuristics; 7(4); 335-350 | M22 |
| Mladenović, Nenad ; Hansen, Pierre | Variable neighborhood search | 1-Jan-1997 | Computers and Operations Research; 24(11); 1097-1100 | M22 |
| Hansen, Pierre; Mladenović, Nenad ; Brimberg, Jack; Pérez, José A.Moreno | Variable neighborhood search | 1-Jan-2019 | Handbook of Metaheuristics; 272; 57-97 | |
| Hansen, Pierre; Mladenović, Nenad | Variable neighborhood search | 1-Jan-2014 | Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, Second Edition; 313-338 | |
| Caporossi, Gilles; Hansen, Pierre; Mladenović, Nenad | Variable neighborhood search | 1-Jan-2016 | Metaheuristics; 77-98 | |
| Hansen, Pierre; Mladenović, Nenad | Variable neighborhood search | 1-Dec-2005 | Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques; 211-238 | |
| Hansen, Pierre; Mladenović, Nenad ; Moreno Pérez, Jośe A. | Variable neighborhood search | 16-Dec-2008 | European Journal of Operational Research; 191(3); 593-595 | M21 |
