Variable neighborhood search: basics and variants P Hansen, N Mladenović, R Todosijević, S Hanafi EURO Journal on Computational Optimization 5 (3), 423-454, 2017 | 396 | 2017 |
An efficient tabu search approach for the 0–1 multidimensional knapsack problem S Hanafi, A Freville European Journal of Operational Research 106 (2-3), 659-675, 1998 | 294 | 1998 |
Genetic algorithm with iterated local search for solving a location-routing problem H Derbel, B Jarboui, S Hanafi, H Chabchoub Expert Systems with Applications 39 (3), 2865-2871, 2012 | 174 | 2012 |
Variable neighborhood search for location routing B Jarboui, H Derbel, S Hanafi, N Mladenović Computers & Operations Research 40 (1), 47-57, 2013 | 168 | 2013 |
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model R Macedo, C Alves, JMV de Carvalho, F Clautiaux, S Hanafi European Journal of Operational Research 214 (3), 536-545, 2011 | 148 | 2011 |
A survey of effective heuristics and their application to a variety of knapsack problems C Wilbaut, S Hanafi, S Salhi IMA journal of management Mathematics 19 (3), 227-244, 2008 | 118 | 2008 |
Tabu search and finite convergence F Glover, S Hanafi Discrete Applied Mathematics 119 (1-2), 3-36, 2002 | 118 | 2002 |
The multidimensional 0-1 knapsack problem—bounds and computational aspects A Fréville, SÏ Hanafi Annals of Operations Research 139, 195-227, 2005 | 113 | 2005 |
A hybrid quantum particle swarm optimization for the multidimensional knapsack problem B Haddar, M Khemakhem, S Hanafi, C Wilbaut Engineering Applications of Artificial Intelligence 55, 1-13, 2016 | 111 | 2016 |
On the convergence of tabu search S Hanafi Journal of heuristics 7 (1), 47-58, 2001 | 107 | 2001 |
A two phase variable neighborhood search for the multi-product inventory routing problem A Mjirda, B Jarboui, R Macedo, S Hanafi, N Mladenović Computers & Operations Research 52, 291-299, 2014 | 105 | 2014 |
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 | 105 | 2010 |
A multi-level search strategy for the 0–1 multidimensional knapsack problem S Boussier, M Vasquez, Y Vimont, S Hanafi, P Michelon Discrete Applied Mathematics 158 (2), 97-109, 2010 | 94 | 2010 |
New convergent heuristics for 0–1 mixed integer programming C Wilbaut, S Hanafi European journal of operational research 195 (1), 62-74, 2009 | 84 | 2009 |
New exact method for large asymmetric distance-constrained vehicle routing problem S Almoustafa, S Hanafi, N Mladenović European Journal of Operational Research 226 (3), 386-394, 2013 | 77 | 2013 |
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem A Mjirda, R Todosijević, S Hanafi, P Hansen, N Mladenović International Transactions in Operational Research 24 (3), 615-633, 2017 | 76 | 2017 |
Improved convergent heuristics for the 0-1 multidimensional knapsack problem S Hanafi, C Wilbaut Annals of Operations Research 183, 125-142, 2011 | 72 | 2011 |
A general variable neighborhood search for solving the uncapacitated -allocation -hub median problem R Todosijević, D Urošević, N Mladenović, S Hanafi Optimization Letters 11 (6), 1109-1121, 2017 | 68 | 2017 |
A dynamic programming algorithm for the bilevel knapsack problem L Brotcorne, S Hanafi, R Mansi Operations Research Letters 37 (3), 215-218, 2009 | 68 | 2009 |
Variable neighborhood search for the travelling deliveryman problem N Mladenović, D Urošević, S Hanafi 4OR 11, 57-73, 2013 | 67 | 2013 |