Up a level |
Gélinas, S., & Soumis, F. (2005). Dantzig-Wolfe decomposition for job shop scheduling. In Column generation (pp. 271-302). 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
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