Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Time Constrained Routing and Scheduling
1992522 citationsJacques Desrosiers, Marius M. Solomon et al.PolyPublie (École Polytechnique de Montréal)profile →
The pickup and delivery problem with time windows
1991445 citationsYvan Dumas, Jacques Desrosiers et al.European Journal of Operational Researchprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Yvan Dumas'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 Yvan Dumas with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yvan Dumas more than expected).
This network shows the impact of papers produced by Yvan Dumas. 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 Yvan Dumas. The network helps show where Yvan Dumas may publish in the future.
Co-authorship network of co-authors of Yvan Dumas
This figure shows the co-authorship network connecting the top 25 collaborators of Yvan Dumas.
A scholar is included among the top collaborators of Yvan Dumas 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 Yvan Dumas. Yvan Dumas is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Desaulniers, Guy, Jacques Desrosiers, Marius M. Solomon, François Soumis, & Yvan Dumas. (1994). Daily Aircraft Routing and Scheduling. PolyPublie (École Polytechnique de Montréal). 1–31.5 indexed citations
5.
Desrosiers, Jacques, Marius M. Solomon, François Soumis, & Yvan Dumas. (1992). Time Constrained Routing and Scheduling. PolyPublie (École Polytechnique de Montréal). 1–152.522 indexed citations breakdown →
6.
Desrosiers, Jacques, et al.. (1991). An Algorithm for Mini-Clustering in Handicapped Transport. PolyPublie (École Polytechnique de Montréal). 1–15.37 indexed citations
7.
Desrosiers, Jacques, et al.. (1991). A Breakthrough in Airline Crew Scheduling. PolyPublie (École Polytechnique de Montréal). 1–18.28 indexed citations
8.
Desrosiers, Jacques, Pierre Girard, Marius M. Solomon, & Yvan Dumas. (1991). An Optimal Algorithm for the Traveling Salesman Problem with Time Windows. Les Cahiers du GERAD. 1–25.1 indexed citations
9.
Desrosiers, Jacques, Marius M. Solomon, Yvan Dumas, Irina Ioachim, & Daniel L. Villeneuve. (1991). A Request Clustering Algorithm for Door-to-Door Handicapped Transportation. Les Cahiers du GERAD. 1–40.3 indexed citations
10.
Dumas, Yvan, Jacques Desrosiers, & François Soumis. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research. 54(1). 7–22.445 indexed citations breakdown →
11.
Dumas, Yvan, François Soumis, & Jacques Desrosiers. (1990). OPTIMIZING THE SCHEDULE FOR A FIXED VEHICLE PATH WITH CONVEX INCONVENIENCE COSTS. TECHNICAL NOTE. Transportation Science. 24(2).2 indexed citations
12.
Dumas, Yvan, François Soumis, & Jacques Desrosiers. (1990). OPTIMIZING THE SCHEDULE FOR A FIXED VEHICLE PATH WITH CONVEX INCONVENIENCE COSTS. Transportation Science. 24(2).39 indexed citations
Desrosiers, Jacques, François Soumis, & Yvan Dumas. (1989). Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs. Les Cahiers du GERAD. 1–20.1 indexed citations
15.
Desrosiers, Jacques, François Soumis, & Yvan Dumas. (1989). Large Scale Multi-Vehicle Dial-a-Ride Problems. Les Cahiers du GERAD. 1–31.34 indexed citations
16.
Dumas, Yvan. (1989). Confection d'itinéraires pour le transport adapté. Les Cahiers du GERAD. 1–208.1 indexed citations
Dumas, Yvan & Jacques Desrosiers. (1986). A Shortest Path Problem for Vehicle Routing with Pick-Up, Delivery and Time Windows. Les Cahiers du GERAD. 1–21.5 indexed citations
Desrosiers, Jacques, François Soumis, & Yvan Dumas. (1984). A Dynamic Programming Solution of the Large Scale Single Vehicle Dial-A-Ride Problem with Time Windows. PolyPublie (École Polytechnique de Montréal). 1–27.7 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.