Pierre Dejax

4.2k total citations · 2 hit papers
41 papers, 3.0k citations indexed

About

Pierre Dejax is a scholar working on Industrial and Manufacturing Engineering, Building and Construction and Organizational Behavior and Human Resource Management. According to data from OpenAlex, Pierre Dejax has authored 41 papers receiving a total of 3.0k indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Industrial and Manufacturing Engineering, 13 papers in Building and Construction and 8 papers in Organizational Behavior and Human Resource Management. Recurrent topics in Pierre Dejax's work include Vehicle Routing Optimization Methods (23 papers), Urban and Freight Transport Logistics (13 papers) and Optimization and Packing Problems (9 papers). Pierre Dejax is often cited by papers focused on Vehicle Routing Optimization Methods (23 papers), Urban and Freight Transport Logistics (13 papers) and Optimization and Packing Problems (9 papers). Pierre Dejax collaborates with scholars based in France, Canada and China. Pierre Dejax's co-authors include Michel Gendreau, Dominique Feillet, Teodor Gabriel Crainic, Olivier Péton, Majid Eskandarpour, Joe Miemczyk, Nathalie Bostel, Jean‐Pierre Kenné, Ali Gharbi and Gilbert Laporte and has published in prestigious journals such as IEEE Transactions on Automatic Control, European Journal of Operational Research and Operations Research.

In The Last Decade

Pierre Dejax

39 papers receiving 2.8k citations

Hit Papers

Sustainable supply chain network design: An o... 2005 2026 2012 2019 2015 2005 100 200 300 400 500

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Pierre Dejax France 22 1.9k 822 674 625 505 41 3.0k
Jairo R. Montoya‐Torres Colombia 28 1.7k 0.9× 610 0.7× 787 1.2× 552 0.9× 355 0.7× 161 3.0k
Nabil Absi France 27 1.5k 0.8× 659 0.8× 592 0.9× 566 0.9× 732 1.4× 78 2.5k
André Langevin Canada 32 2.0k 1.0× 349 0.4× 689 1.0× 566 0.9× 343 0.7× 109 2.8k
Vincent F. Yu Taiwan 34 1.8k 0.9× 642 0.8× 810 1.2× 782 1.3× 263 0.5× 156 3.6k
Javier Faulín Spain 33 1.9k 1.0× 480 0.6× 1.1k 1.6× 1.1k 1.7× 224 0.4× 148 3.5k
Olivier Péton France 17 822 0.4× 578 0.7× 584 0.9× 571 0.9× 279 0.6× 31 1.6k
Teresa Melo Germany 15 1.0k 0.5× 966 1.2× 504 0.7× 212 0.3× 710 1.4× 30 2.5k
Stephen C.H. Leung Hong Kong 32 1.6k 0.8× 809 1.0× 315 0.5× 302 0.5× 1.1k 2.1× 72 3.4k
Seyed Mohammad Javad Mirzapour Al-e-Hashem Iran 24 1.1k 0.6× 898 1.1× 265 0.4× 278 0.4× 622 1.2× 72 2.6k
Leandro C. Coelho Canada 36 3.2k 1.7× 456 0.6× 1.1k 1.7× 922 1.5× 537 1.1× 112 4.0k

Countries citing papers authored by Pierre Dejax

Since Specialization
Citations

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

Fields of papers citing papers by Pierre Dejax

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Pierre Dejax

This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Dejax. A scholar is included among the top collaborators of Pierre Dejax 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 Pierre Dejax. Pierre Dejax is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bostel, Nathalie, et al.. (2019). A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours. Computers & Industrial Engineering. 135. 105–119. 36 indexed citations
3.
Eskandarpour, Majid, Pierre Dejax, & Olivier Péton. (2019). Multi-directional local search for sustainable supply chain network design. International Journal of Production Research. 59(2). 412–428. 22 indexed citations
4.
Eskandarpour, Majid, Pierre Dejax, & Olivier Péton. (2016). A large neighborhood search heuristic for supply chain network design. Computers & Operations Research. 80. 23–37. 36 indexed citations
5.
Dejax, Pierre, et al.. (2015). A 2-stage method for a field service routing problem with stochastic travel and service times. Computers & Operations Research. 65. 64–75. 35 indexed citations
6.
Kenné, Jean‐Pierre, et al.. (2014). Production and maintenance planning for a failure-prone deteriorating manufacturing system: a hierarchical control approach. The International Journal of Advanced Manufacturing Technology. 76(9-12). 1607–1619. 33 indexed citations
7.
Dejax, Pierre, et al.. (2014). Stochastic optimal control of manufacturing systems under production-dependent failure rates. International Journal of Production Economics. 150. 174–187. 25 indexed citations
8.
Kenné, Jean‐Pierre, et al.. (2014). Production Planning of a Failure-Prone Manufacturing/Remanufacturing System with Production-Dependent Failure Rates. Applied Mathematics. 5(10). 1557–1572. 17 indexed citations
9.
Tricoire, Fabien, et al.. (2011). Exact and hybrid methods for the multiperiod field service routing problem. Central European Journal of Operations Research. 21(2). 359–377. 17 indexed citations
10.
Chen, Lu, Nathalie Bostel, Pierre Dejax, Jianguo Cai, & Lifeng Xi. (2006). A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research. 181(1). 40–58. 178 indexed citations
11.
Chen, Lu, Lifeng Xi, Jianguo Cai, Nathalie Bostel, & Pierre Dejax. (2006). An integrated approach for modeling and solving the scheduling problem of container handling systems. Journal of Zhejiang University. Science A. 7(2). 234–239. 14 indexed citations
12.
Haouari, Mohamed & Pierre Dejax. (1997). Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées. RAIRO - Operations Research. 31(2). 117–131. 1 indexed citations
13.
Dejax, Pierre, et al.. (1994). An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal. Annals of Operations Research. 50(1). 263–279. 8 indexed citations
14.
Crainic, Teodor Gabriel, L. D. Delorme, & Pierre Dejax. (1993). A branch-and-bound method for multicommodity location with balancing requirements. European Journal of Operational Research. 65(3). 368–382. 25 indexed citations
15.
Gendreau, Michel, et al.. (1991). FORECASTING SHORT-TERM DEMAND FOR EMPTY CONTAINERS: A CASE STUDY. Transportation Research Record Journal of the Transportation Research Board. 1 indexed citations
16.
Crainic, Teodor Gabriel & Pierre Dejax. (1989). Freight Distribution and Transportation Systems Planning. International Journal of Physical Distribution & Materials Management. 19(1). 3–12. 59 indexed citations
17.
Laporte, Gilbert & Pierre Dejax. (1989). Dynamic Location-routeing Problems. Journal of the Operational Research Society. 40(5). 471–482. 44 indexed citations
18.
Dejax, Pierre. (1988). Introduction to transportation planning. European Journal of Operational Research. 37(1). 140–141. 12 indexed citations
19.
Laporte, Gilbert & Pierre Dejax. (1988). DYNAMIC LOCATION-ROUTING PROBLEMS. 36 indexed citations
20.
Dejax, Pierre & Teodor Gabriel Crainic. (1987). Survey Paper—A Review of Empty Flows and Fleet Management Models in Freight Transportation. Transportation Science. 21(4). 227–248. 206 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

Rankless by CCL
2026