Up a level |
This 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.
A 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.
El Hachemi, N., Gendreau, M., & Rousseau, L.-M. (2009, May). A heuristic to solve the weekly log-truck scheduling problem [Paper]. International Conference on Industrial Engineering and Systems Management (IESM 2009), Montréal, Québec. Unavailable
Feillet, D., Gendreau, M., & Rousseau, L.-M. (2004, January). New Refinements for the Solution of Vehicle Routing Problems with Column Generation [Paper]. Triennal Symposium on Transportation Analysis V. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (2002, January). Solving small VRPTWs with constraint programming based column generation [Paper]. International Symposium on Combinatorial Optimization, Paris, France. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (2000, January). A Hybrid Algorithm to Solve Physician Rostering Problem [Paper]. 2nd Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (1999, January). Hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules [Paper]. Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (1999, June). Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules [Paper]. 8es Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (1999, January). Using constraint-based operators with Variable Neighborhood Search to solve the Vehicle Routing Problem with Time Windows [Paper]. 1st Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems. Unavailable
Gendreau, M., Sanso, B., & Stanford, D. A. (1996). Optimizing routing in packet-switched networks with non-poisson offered traffic. Telecommunication Systems, 5(4), 323-340. External link