 | 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.
Gélinas, S., & Soumis, F. (2005). Dantzig-Wolfe decomposition for job shop scheduling. In Column generation (pp. 271-302). External link
Gélinas, S., & Soumis, F. (2004). Dantzig-Wolfe Decomposition for Job Shop Scheduling. (Technical Report n° G-2004-59). External link
Gélinas, S. (2004). Problèmes d'ordonnancement [Ph.D. thesis, École Polytechnique de Montréal]. Unavailable
Gélinas, S., & Soumis, F. (1997). A dynamic programming algorithm for single machine scheduling with ready times. Annals of Operations Research, 69, 135-156. External link
Gélinas, S., Hansen, P., Jaumard, B., & Hansen, P. (1993, January). A labeling algorithm for minimum sum of diameters partitioning of graphs [Paper]. Partitioning data sets, New Brunswick, NJ. External link
Gélinas, S., Desrochers, M., Desrosiers, J., & Solomon, M. M. (1995). A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research, 61(1), 91-109. External link
Ioachim, I., Gélinas, S., Soumis, F., & Desrosiers, J. (1998). Dynamic Programming Algorithm for the Shortest Path Problem With Time Windows and Linear Node Costs. Networks, 31(3), 193-204. External link
Langevin, A., Desrochers, M., Desrosiers, J., Gélinas, S., & Soumis, F. (1993). A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows. Networks, 23(7), 631-640. External link
Langevin, A., Desrochers, M., Desrosiers, J., Gélinas, S., & Soumis, F. (1992). A Two-Commodity Flow Formulation for the Traveling Salesman and the Makespan Problems with Time Windows. (Technical Report n° G-90-44). External link
Ziarati, K., Soumis, F., Desrosiers, J., Gélinas, S., & Saintonge, A. (1997). Locomotive assignment with heterogeneous consists at cn north america. European Journal of Operational Research, 97(2), 281-292. External link
Ziarati, K., Soumis, F., Desrosiers, J., Gélinas, S., & Saintonge, A. (1996). Locomotive Assignment with Heterogeneous Consists at CN North America. (Technical Report n° G-95-31). External link
