 | 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.
Chen, L., Gendreau, M., Ha, M. H., & Langevin, A. (2016). A robust optimization approach for the road network daily maintenance routing problem with uncertain service time. Transportation Research Part E: Logistics and Transportation Review, 85, 40-51. External link
Ha, M. H., Quimper, C.-G., & Rousseau, L.-M. (2015, August). General Bounding Mechanism for Constraint Programs [Paper]. 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland. External link
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2014). An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Computers and Operations Research, 43(1), 9-19. External link
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2014). Solving the close-enough arc routing problem. Networks, 63(1), 107-118. External link
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2013). An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. European Journal of Operational Research, 226(2), 211-220. External link
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012, February). An exact algorithm for the close enough traveling salesman problem with arc covering constraints [Paper]. 1st International Conference on Operations Research and Enterprise Systems (ICORES 2012), Vilamoura, Algarve, Portugal. External link
