Saïd Hanafi

788 total citations
21 papers, 579 citations indexed

About

Saïd Hanafi is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Saïd Hanafi has authored 21 papers receiving a total of 579 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Industrial and Manufacturing Engineering, 6 papers in Computer Networks and Communications and 6 papers in Artificial Intelligence. Recurrent topics in Saïd Hanafi's work include Vehicle Routing Optimization Methods (12 papers), Optimization and Packing Problems (9 papers) and Optimization and Search Problems (6 papers). Saïd Hanafi is often cited by papers focused on Vehicle Routing Optimization Methods (12 papers), Optimization and Packing Problems (9 papers) and Optimization and Search Problems (6 papers). Saïd Hanafi collaborates with scholars based in France, Serbia and Canada. Saïd Hanafi's co-authors include Nenad Mladenović, Raca Todosijević, Christophe Wilbaut, Bassem Jarboui, Houda Derbel, Mahdi Khemakhem, Dragan Urošević, Bernard Gendron, Renata Mansini and Pierre Hansen and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Information Sciences.

In The Last Decade

Saïd Hanafi

21 papers receiving 567 citations

Peers

Saïd Hanafi

IME

OBHRM

CNC

Francisco Ángel-Bello Mexico

Jesús Sánchez‐Oro Spain

Ada Álvarez Mexico

Krzysztof Fleszar Lebanon

Flávio K. Miyazawa Brazil

Isaac Plana Spain

Moshe B. Rosenwein United States

Daniel Guimarans Spain

Zorica Stanimirović Serbia

Inmaculada Rodrı́guez-Martı́n Spain

Francisco Ángel-Bello Mexico

Saïd Hanafi

521 ×1.2

IME

86 ×0.7

76 ×0.8

OBHRM

83 ×1.0

73 ×1.0

CNC

Citations per year, relative to Saïd Hanafi Saïd Hanafi (= 1×) peers Francisco Ángel-Bello

Countries citing papers authored by Saïd Hanafi

Since Specialization

Citations

This map shows the geographic impact of Saïd Hanafi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Saïd Hanafi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Saïd Hanafi more than expected).

Fields of papers citing papers by Saïd Hanafi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Saïd Hanafi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Saïd Hanafi. The network helps show where Saïd Hanafi may publish in the future.

Co-authorship network of co-authors of Saïd Hanafi

This figure shows the co-authorship network connecting the top 25 collaborators of Saïd Hanafi. A scholar is included among the top collaborators of Saïd Hanafi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Saïd Hanafi. Saïd Hanafi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Hanafi, Saïd, Gintaras Palubeckis, & Fred Glover. (2020). Bi-objective optimization of biclustering with binary data. Information Sciences. 538. 444–466. 6 indexed citations

Hanafi, Saïd, et al.. (2019). The multi-visit team orienteering problem with precedence constraints. European Journal of Operational Research. 282(2). 515–529. 43 indexed citations

Benmansour, Rachid, et al.. (2018). The single-processor scheduling problem with time restrictions: complexity and related problems. Journal of Scheduling. 22(4). 465–471. 4 indexed citations

Hanafi, Saïd, et al.. (2018). Ant colony optimisation combined with variable neighbourhood search for scheduling preventive railway maintenance activities. International Journal of Intelligent Engineering Informatics. 6(1/2). 78–78. 2 indexed citations

Gendron, Bernard, Saïd Hanafi, & Raca Todosijević. (2018). Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. European Journal of Operational Research. 268(1). 70–81. 18 indexed citations

Hanafi, Saïd, et al.. (2017). Clustering approach in maintenance of capillary railway network. Electronic Notes in Discrete Mathematics. 58. 239–246. 3 indexed citations

Todosijević, Raca, Rachid Benmansour, Saïd Hanafi, Nenad Mladenović, & Abdelhakim Artiba. (2016). Nested general variable neighborhood search for the periodic maintenance problem. European Journal of Operational Research. 252(2). 385–396. 25 indexed citations

Khemakhem, Mahdi, et al.. (2016). A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem. Engineering Applications of Artificial Intelligence. 55. 1–13. 61 indexed citations

Todosijević, Raca, et al.. (2016). Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. International Transactions in Operational Research. 24(3). 615–633. 61 indexed citations

10.

Todosijević, Raca, Saïd Hanafi, Dragan Urošević, Bassem Jarboui, & Bernard Gendron. (2016). A general variable neighborhood search for the swap-body vehicle routing problem. Computers & Operations Research. 78. 468–479. 35 indexed citations

11.

Khemakhem, Mahdi, et al.. (2015). A hybrid heuristic for the 0–1 Knapsack Sharing Problem. Expert Systems with Applications. 42(10). 4653–4666. 20 indexed citations

12.

Todosijević, Raca, Dragan Urošević, Nenad Mladenović, & Saïd Hanafi. (2015). A general variable neighborhood search for solving the uncapacitated $$r$$ r -allocation $$p$$ p -hub median problem. Optimization Letters. 11(6). 1109–1121. 50 indexed citations

13.

Todosijević, Raca, et al.. (2014). Variable and single neighbourhood diving for MIP feasibility. Yugoslav journal of operations research. 26(2). 131–157. 17 indexed citations

14.

Hanafi, Saïd, et al.. (2014). New variable neighbourhood search based 0-1 MIP heuristics. Yugoslav journal of operations research. 25(3). 343–360. 19 indexed citations

15.

Todosijević, Raca, et al.. (2014). A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optimization Letters. 11(6). 1047–1056. 22 indexed citations

16.

Brotcorne, Luce, et al.. (2012). One-level reformulation of the bilevel Knapsack problem using dynamic programming. Discrete Optimization. 10(1). 1–10. 29 indexed citations

17.

Hanafi, Saïd, et al.. (2012). Three-stage hybrid-flowshop model for cross-docking. Computers & Operations Research. 40(4). 1109–1121. 32 indexed citations

18.

Jarboui, Bassem, Houda Derbel, Saïd Hanafi, & Nenad Mladenović. (2012). Variable neighborhood search for location routing. Computers & Operations Research. 40(1). 47–57. 99 indexed citations

19.

Hanafi, Saïd, Ahmed Rebaï, & Michel Vasquez. (2011). Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. Journal of Heuristics. 19(4). 645–677. 8 indexed citations

20.

Fréville, Arnaud, et al.. (2009). A tabu search with an oscillation strategy for the discriminant analysis problem. Computers & Operations Research. 37(10). 1688–1696. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact