 | 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.
Archetti, C., Bouchard, M., & Desaulniers, G. (2011). Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transportation Science, 45(3), 285-298. External link
Archetti, C., Bouchard, M., & Desaulniers, G. (2009). Enhanced Branch-and-Price-and-Cut for Vehicle Routing with Split Deliveries and Time Windows. (Technical Report n° G-2009-81). External link
Bouchard, M., Čangalović, M., & Hertz, A. (2010). On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems. Journal of Scheduling, 13(6), 583-595. External link
Bouchard, M., Čangalović, M., & Hertz, A. (2009). About equivalent interval colorings of weighted graphs. Discrete Applied Mathematics, 157(17), 3615-3624. External link
Bouchard, M., Hertz, A., & Desaulniers, G. (2009). Lower bounds and a tabu search algorithm for the minimum deficiency problem. Journal of Combinatorial Optimization, 17(2), 168-191. External link
Bouchard, M., Čangalović, M., & Hertz, A. (2008). About Equivalent Interval Colorings of Weighted Graphs. (Technical Report n° G-2008-03). External link
Bouchard, M. (2008). Coloration de graphes et attribution d'activités dans des quarts de travail [Ph.D. thesis, École Polytechnique de Montréal]. Available
Bouchard, M., Čangalović, M., & Hertz, A. (2007). On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems. (Technical Report n° G-2007-69). External link
Bouchard, M., Hertz, A., & Desaulniers, G. (2007). Lower Bounds and a Tabu Search Algorithm for the Minimum Deficiency Problem. (Technical Report n° G-2007-14). External link
Bouchard, M. (2004). Optimisation des pauses dans le problème de fabrication d'horaires avec quarts de travail [Master's thesis, École Polytechnique de Montréal]. Available
Lequy, Q., Bouchard, M., Desaulniers, G., Soumis, F., & Tachefine, B. (2012). Assigning multiple activities to work shifts. Journal of Scheduling, 15(2), 239-251. External link
Lequy, Q., Bouchard, M., Desaulniers, G., Soumis, F., & Tachefine, B. (2009). Assigning Multiple Activities to Work Shifts. (Technical Report n° G-2009-86). External link
