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.
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
1992823 citationsMartin Desrochers, Jacques Desrosiers et al.profile →
Selected Topics in Column Generation
2005733 citationsMarco E. Lübbecke, Jacques Desrosiersprofile →
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.profile →
Survey Paper—Time Window Constrained Routing and Scheduling Problems
1988381 citationsMarius M. Solomon, Jacques Desrosiersprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Jacques Desrosiers
Since
Specialization
Citations
This map shows the geographic impact of Jacques Desrosiers'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 Jacques Desrosiers with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jacques Desrosiers more than expected).
Fields of papers citing papers by Jacques Desrosiers
This network shows the impact of papers produced by Jacques Desrosiers. 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 Jacques Desrosiers. The network helps show where Jacques Desrosiers may publish in the future.
Co-authorship network of co-authors of Jacques Desrosiers
This figure shows the co-authorship network connecting the top 25 collaborators of Jacques Desrosiers.
A scholar is included among the top collaborators of Jacques Desrosiers 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 Jacques Desrosiers. Jacques Desrosiers is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Desaulniers, Guy, et al.. (2016). Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU). 1–23.1 indexed citations
3.
Desaulniers, Guy, Jacques Desrosiers, & Simon Spoorendonk. (2010). The Vehicle Routing Problem with Time Windows: State-of-the-Art Exact Solution Methods. PolyPublie (École Polytechnique de Montréal). 1–13.4 indexed citations
4.
Desaulniers, Guy, et al.. (2008). A Branch-and-Price-and-Cut Method for a Liquefied Natural Gas Inventory Routing Problem. Les Cahiers du GERAD. 1–28.1 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.
Desrosiers, Jacques & Marco E. Lübbecke. (2002). Selected Topics in Column Generation. Les Cahiers du GERAD. 1–35.20 indexed citations
7.
Desrosiers, Jacques, Nenad Mladenović, & Daniel L. Villeneuve. (2002). Design of Balanced MBA Student Teams. Les Cahiers du GERAD. 1–14.
8.
Cordeau, Jean‐François, et al.. (2000). Operational Car Assignment at VIA Rail Canada. Les Cahiers du GERAD. 1–30.1 indexed citations
9.
Cordeau, Jean‐François, Jacques Desrosiers, & François Soumis. (1998). A Benders Decomposition Approach for the Locomotive and Car Assignment Problem. PolyPublie (École Polytechnique de Montréal). 1–32.5 indexed citations
10.
Cordeau, Jean‐François, et al.. (1998). Simultaneous Locomotive and Car Assignment at VIA Rail Canada. PolyPublie (École Polytechnique de Montréal). 1–31.2 indexed citations
11.
Desrosiers, Jacques, et al.. (1997). Stabilisation dans le cadre de la génération de colonnes. Les Cahiers du GERAD. 1–12.5 indexed citations
12.
Desrosiers, Jacques, François Soumis, Irina Ioachim, & Nicolas Bélanger. (1994). Fleet Assignment and Routing with Schedule Synchronization Constraints. Les Cahiers du GERAD. 1–27.2 indexed citations
13.
Desrosiers, Jacques, et al.. (1991). An Algorithm for Mini-Clustering in Handicapped Transport. PolyPublie (École Polytechnique de Montréal). 1–15.37 indexed citations
14.
Desrosiers, Jacques, et al.. (1991). A Breakthrough in Airline Crew Scheduling. PolyPublie (École Polytechnique de Montréal). 1–18.28 indexed citations
15.
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
16.
Desrochers, Martin, Jacques Desrosiers, & Marius M. Solomon. (1990). Using Column Generation to Solve the Vehicle Routing Problem with Time Windows. Les Cahiers du GERAD. 1–13.2 indexed citations
17.
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
18.
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
19.
Langevin, André, François Soumis, & Jacques Desrosiers. (1988). CLASSIFICATION OF TRAVELING SALESMAN PROBLEM FORMULATIONS. PolyPublie (École Polytechnique de Montréal). 1–11.2 indexed citations
20.
Desrosiers, Jacques, François Soumis, & Martin Desrochers. (1983). Routing with Time Windows: Synthesis. Les Cahiers du GERAD. 1–18.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.