Variable neighborhood search and local branching P Hansen, N Mladenović, D Urošević Computers & Operations Research 33 (10), 3034-3045, 2006 | 195 | 2006 |

A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem A Ilić, D Urošević, J Brimberg, N Mladenović European Journal of Operational Research 206 (2), 289-300, 2010 | 144 | 2010 |

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem N Mladenović, D Urošević, A Ilić European Journal of Operational Research 220 (1), 270-285, 2012 | 125 | 2012 |

Variable neighborhood search for the maximum clique P Hansen, N Mladenović, D Urošević Discrete Applied Mathematics 145 (1), 117-125, 2004 | 110 | 2004 |

Reformulation descent applied to circle packing problems N Mladenović, F Plastria, D Urošević Computers & Operations Research 32 (9), 2419-2434, 2005 | 102 | 2005 |

Primal-dual variable neighborhood search for the simple plant-location problem P Hansen, J Brimberg, D Urošević, N Mladenović INFORMS Journal on Computing 19 (4), 552-564, 2007 | 100 | 2007 |

Variable neighbourhood decomposition search for 0–1 mixed integer programs J Lazić, S Hanafi, N Mladenović, D Urošević Computers & Operations Research 37 (6), 1055-1067, 2010 | 87 | 2010 |

Solving large *p*-median clustering problems by primal–dual variable neighborhood searchP Hansen, J Brimberg, D Urošević, N Mladenović Data Mining and Knowledge Discovery 19 (3), 351-375, 2009 | 81 | 2009 |

Variable neighbourhood search for bandwidth reduction N Mladenovic, D Urosevic, D Pérez-Brito, CG García-González European Journal of Operational Research 200 (1), 14-27, 2010 | 56 | 2010 |

An efficient general variable neighborhood search for large travelling salesman problem with time windows N Mladenović, R Todosijević, D Urošević Yugoslav Journal of Operations Research 23 (1), 19-30, 2013 | 54 | 2013 |

Variable neighborhood search for the travelling deliveryman problem N Mladenović, D Urošević, S Hanafi 4OR 11 (1), 57-73, 2013 | 52 | 2013 |

Variable neighborhood search for the heaviest k-subgraph J Brimberg, N Mladenović, D Urošević, E Ngai Computers & Operations Research 36 (11), 2885-2891, 2009 | 51 | 2009 |

Less is more: basic variable neighborhood search for minimum differential dispersion problem N Mladenović, R Todosijević, D Urošević Information Sciences 326, 160-171, 2016 | 49 | 2016 |

Fast metaheuristics for the discrete (*r*|*p*)-centroid problemIA Davydov, YA Kochetov, N Mladenovic, D Urosevic Automation and Remote Control 75 (4), 677-687, 2014 | 44 | 2014 |

Variable neighborhood search for the vertex weighted k-cardinality tree problem J Brimberg, D Urošević, N Mladenović European Journal of Operational Research 171 (1), 74-84, 2006 | 44 | 2006 |

A restarted and modified simplex search for unconstrained optimization QH Zhao, D Urosević, N Mladenović, P Hansen Computers & Operations Research 36 (12), 3263-3271, 2009 | 41 | 2009 |

Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem D Urošević, J Brimberg, N Mladenović Computers & Operations Research 31 (8), 1205-1213, 2004 | 39 | 2004 |

A geneal vaiable neighbohood seach fo solving the uncapacitated $$$$-allocation $$ p $$ p-hub median poblem R Todosijević, D Urošević, N Mladenović, S Hanafi Optimization Letters 11 (6), 1109-1121, 2017 | 37 | 2017 |

Solving the maximally diverse grouping problem by skewed general variable neighborhood search J Brimberg, N Mladenović, D Urošević Information Sciences 295, 650-675, 2015 | 35 | 2015 |

Variable neighborhood search for the k-cardinality tree N Mladenović, D Urošević Metaheuristics: computer decision-making, 481-500, 2003 | 35 | 2003 |