Countries citing papers authored by Guy Desaulniers
Since
Specialization
Citations
This map shows the geographic impact of Guy Desaulniers'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 Guy Desaulniers with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guy Desaulniers more than expected).
This network shows the impact of papers produced by Guy Desaulniers. 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 Guy Desaulniers. The network helps show where Guy Desaulniers may publish in the future.
Co-authorship network of co-authors of Guy Desaulniers
This figure shows the co-authorship network connecting the top 25 collaborators of Guy Desaulniers.
A scholar is included among the top collaborators of Guy Desaulniers 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 Guy Desaulniers. Guy Desaulniers 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
10.
Errico, Fausto, Guy Desaulniers, Michel Gendreau, Walter Rei, & Louis-Martin Rousseau. (2014). A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. PolyPublie (École Polytechnique de Montréal). 1–23.1 indexed citations
11.
Desaulniers, Guy, et al.. (2014). A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. PolyPublie (École Polytechnique de Montréal). 1–22.1 indexed citations
12.
Desaulniers, Guy, et al.. (2013). A Branch-Cut-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands. Les Cahiers du GERAD. 1–22.1 indexed citations
13.
Desaulniers, Guy, et al.. (2012). The Discrete Time Window Assignment Vehicle Routing Problem. Les Cahiers du GERAD. 1–21.4 indexed citations
14.
Desaulniers, Guy, et al.. (2009). European Driver Rules in Vehicle Routing with Time Windows. PolyPublie (École Polytechnique de Montréal). 1–29.
15.
Desaulniers, Guy, et al.. (2009). Assigning Multiple Activities to Work Shifts. Les Cahiers du GERAD. 1–22.2 indexed citations
16.
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
17.
Irnich, Stefan, Guy Desaulniers, Jacques Desrosiers, & Ahmed Hadjar. (2007). Path Reduced Costs for Eliminating Arcs. Les Cahiers du GERAD. 1–36.6 indexed citations
18.
Desaulniers, Guy, et al.. (2003). Dynamic Aggregation of Set Partitioning Constraints in Column Generation. Les Cahiers du GERAD. 1–29.1 indexed citations
19.
Cordeau, Jean‐François, et al.. (2000). Operational Car Assignment at VIA Rail Canada. Les Cahiers du GERAD. 1–30.1 indexed citations
20.
Desaulniers, Guy & Daniel L. Villeneuve. (1997). The Shortest Path Problem with Time Windows and Linear Waiting Costs. PolyPublie (École Polytechnique de Montréal). 1–24.1 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.