Ahmed Hadjar

482 total citations
11 papers, 352 citations indexed

About

Ahmed Hadjar is a scholar working on Industrial and Manufacturing Engineering, Automotive Engineering and General Health Professions. According to data from OpenAlex, Ahmed Hadjar has authored 11 papers receiving a total of 352 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Industrial and Manufacturing Engineering, 5 papers in Automotive Engineering and 1 paper in General Health Professions. Recurrent topics in Ahmed Hadjar's work include Vehicle Routing Optimization Methods (9 papers), Transportation and Mobility Innovations (5 papers) and Advanced Manufacturing and Logistics Optimization (5 papers). Ahmed Hadjar is often cited by papers focused on Vehicle Routing Optimization Methods (9 papers), Transportation and Mobility Innovations (5 papers) and Advanced Manufacturing and Logistics Optimization (5 papers). Ahmed Hadjar collaborates with scholars based in Canada, Germany and United Kingdom. Ahmed Hadjar's co-authors include Guy Desaulniers, François Soumis, Odile Marcotte, Stefan Irnich, Jacques Desrosiers and Jean Fonlupt and has published in prestigious journals such as SHILAP Revista de lepidopterología, Operations Research and Computers & Operations Research.

In The Last Decade

Ahmed Hadjar

11 papers receiving 332 citations

Peers

Ahmed Hadjar

IME

AE

BC

TRANS

EEE

Ulrike Ritzinger Austria

Bjørn Petersen Denmark

Tore Grünert Germany

Mads Kehlet Jepsen Denmark

Mikio Kubo Japan

Irina Ioachim Canada

Brian Kallehauge Denmark

Sandra Ulrich Ngueveu France

José Cáceres-Cruz Spain

G.B. Alvarenga Brazil

Ulrike Ritzinger Austria

Ahmed Hadjar

248 ×0.8

IME

215 ×1.1

AE

110 ×1.4

BC

81 ×1.2

TRANS

33 ×1.3

EEE

Citations per year, relative to Ahmed Hadjar Ahmed Hadjar (= 1×) peers Ulrike Ritzinger

Countries citing papers authored by Ahmed Hadjar

Since Specialization

Citations

This map shows the geographic impact of Ahmed Hadjar'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 Ahmed Hadjar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ahmed Hadjar more than expected).

Fields of papers citing papers by Ahmed Hadjar

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ahmed Hadjar. 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 Ahmed Hadjar. The network helps show where Ahmed Hadjar may publish in the future.

Co-authorship network of co-authors of Ahmed Hadjar

This figure shows the co-authorship network connecting the top 25 collaborators of Ahmed Hadjar. A scholar is included among the top collaborators of Ahmed Hadjar 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 Ahmed Hadjar. Ahmed Hadjar 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:

11 of 11 papers shown

1.

Desaulniers, Guy, et al.. (2013). Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem. SHILAP Revista de lepidopterología. 1(3-4). 283–312. 3 indexed citations

2.

Irnich, Stefan, Guy Desaulniers, Jacques Desrosiers, & Ahmed Hadjar. (2009). Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling. INFORMS journal on computing. 22(2). 297–313. 46 indexed citations

3.

Hadjar, Ahmed & François Soumis. (2008). Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows. Computers & Operations Research. 36(7). 2160–2172. 29 indexed citations

4.

Desaulniers, Guy, et al.. (2008). Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows. Transportation Science. 42(3). 387–404. 174 indexed citations

5.

Irnich, Stefan, Guy Desaulniers, Jacques Desrosiers, & Ahmed Hadjar. (2007). Path Reduced Costs for Eliminating Arcs. Les Cahiers du GERAD. 1–36. 6 indexed citations

6.

Desaulniers, Guy, et al.. (2006). Tabu Search, Generalized k-Path Inequalities, and Partial Elementarity for the Vehicle Routing Problem with Time Windows. 4 indexed citations

7.

Desaulniers, Guy, et al.. (2006). Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows. PolyPublie (École Polytechnique de Montréal). 1–36. 3 indexed citations

8.

Hadjar, Ahmed, Odile Marcotte, & François Soumis. (2006). A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem. Operations Research. 54(1). 130–149. 79 indexed citations

9.

Soumis, François & Ahmed Hadjar. (2005). Window Reduction for the Multiple Depot Vehicle Scheduling Problem with Time Windows. Les Cahiers du GERAD. 1–30. 2 indexed citations

10.

Fonlupt, Jean & Ahmed Hadjar. (2002). The stable set polytope and some operations on graphs. Discrete Mathematics. 252(1-3). 123–140. 1 indexed citations

11.

Marcotte, Odile, François Soumis, & Ahmed Hadjar. (2001). A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem. Les Cahiers du GERAD. 1–47. 5 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