 | Monter d'un niveau |
Artigues, C., Gendreau, M., Rousseau, L.-M., & Vergnaud, A. (2009). Solving and integrated employee timetabling and job-shop scheduling problem via hybrid branch-and -bound. Computers & Operations Research, 36(8), 2330-2340. Lien externe
van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., & Sabharwal, A. (2009). New filtering algorithms for combinations of among constraints. Constraints, 14(2), 273-292. Lien externe
Malapert, A., Cambazard, H., Guéret, C., Jussien, N., Langevin, A., & Rousseau, L.-M. (2009). Constraint Programming Approach to the Open-Shop Problem. (Rapport technique n° CIRRELT-2009-25). Lien externe
Prescott-Gagnon, É., Desaulniers, G., Drexl, M., & Rousseau, L.-M. (2009). European Driver Rules in Vehicle Routing with Time Windows. (Rapport technique n° G-2009-68). Lien externe
El Hachemi, N., Gendreau, M., & Rousseau, L.-M. (mai 2009). A heuristic to solve the weekly log-truck scheduling problem [Communication écrite]. International Conference on Industrial Engineering and Systems Management (IESM 2009), Montréal, Québec. Non disponible
El Hachemi, N., Gendreau, M., & Rousseau, L.-M. (mai 2009). A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem [Communication écrite]. 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2009), Pittsburgh, PA, USA. Publié dans Lecture notes in computer science. Lien externe
Gendreau, M., El Hachemi, N., & Rousseau, L.-M. (juillet 2009). A hybrid LS/CP approach to solve the weekly log-truck scheduling problem [Communication écrite]. 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany (10 pages). Non disponible
Pellerin, R., Sadr, J., Guevremont, M., & Rousseau, L.-M. (mai 2009). Planning of International Projects with Material Constraints [Communication écrite]. International Conference on Industrial Engineering and Systems Management (IESM 2009), Montréal, Québec. Non disponible
Pesant, G., Quimper, C.-G., Rousseau, L.-M., & Sellmann, M. (mai 2009). The polytope of context-free grammar constraints [Communication écrite]. 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Pittsburgh, PA, USA. Lien externe
Prescott-Gagnon, E., Desaulniers, G., & Rousseau, L.-M. (mai 2007). A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows [Communication écrite]. Recent Advances in Vehicle Routing Optimization (ROUTE 2007), Jekyll Island, GA. Publié dans Networks, 54(4). Lien externe
