 | 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.
Côté, J.-F., Gendreau, M., & Potvin, J.-Y. (2014). An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints. Operations Research, 62(5), 1126-1141. External link
Côté, J.-F., Potvin, J.-Y., & Gendreau, M. (2013). The vehicle routing problem with stochastic two-dimensional items. (Technical Report n° CIRRELT-2013-84). External link
Côté, J.-F., Gendreau, M., & Potvin, J.-Y. (2013). An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraint. (Technical Report n° CIRRELT-2013-26). External link
Côté, J.-F., Archetti, C., Speranza, M. G., Gendreau, M., & Potvin, J.-Y. (2012). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks, 60(4), 212-226. External link
Côté, J.-F., Archetti, C., Speranza, M. G., Gendreau, M., & Potvin, J.-Y. (2010). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. (Technical Report n° CIRRELT-2010-55). External link
Côté, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). Large neighborhood search for the single vehicle pickup and delivery problem with multiple loading stacks. (Technical Report n° CIRRELT-2009-47). External link
Parada Pradenas, L., Côté, J.-F., & Gendreau, M. (2025). Service Level Requirements for Real-Life-Sized Bicycle Sharing Systems. (Working Paper n° CIRRELT-2025-02). External link
Parada, L., Côté, J.-F., & Gendreau, M. (2024). An integer L-shaped method for the static stochastic bicycle repositioning problem. (Technical Report n° 2024-26). External link
Parada, L., Legault, R., Côté, J.-F., & Gendreau, M. (2023). The disaggregated integer L-shaped method for the stochastic vehicle routing problem. (Technical Report n° CIRRELT-2023-05). External link
