 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2021). The vehicle routing problem with cross-docking and resource constraints. Journal of Heuristics, 27(1-2), 31-61. External link
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2017). The vehicle routing problem with cross-docking and resource constraints. (Technical Report n° CIRRELT-2017-23). External link
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2017). A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Computers & Operations Research, 84, 116-126. External link
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2016). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. European Journal of Operational Research, 254(1), 80-91. External link
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2016). A Matheuristic Based on Large Neighborhood Search for the Vehicle Routing Problem with Cross-Docking. (Technical Report n° CIRRELT-2016-09). External link
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2014). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. (Technical Report n° CIRRELT-2014-33). External link
Masson, R., Ropke, S., Lehuédé, F., & Péton, O. (2014). A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. European Journal of Operational Research, 236(3), 849-862. External link
Quirion-Blais, O., Langevin, A., Lehuédé, F., Péton, O., & Trépanier, M. (2016, May). Solving the large-scale min-max K-rural postman problem for snow plowing [Paper]. 2nd Workshop on Arc Routing Problems (WARP 2016), Lisbon, Portugal. Published in Networks, 70(3). External link
Quirion-Blais, O., Langevin, A., Lehuédé, F., Péton, O., & Trépanier, M. (2016). Solving the large-scale min-max K-rural postman problem for snow plowing. (Technical Report n° CIRRELT-2016-56). External link
