 | Monter d'un niveau |
Brouer, B. D., Desaulniers, G., Karsten, C. V., & Pisinger, D. (septembre 2015). A matheuristic for the liner shipping network design problem with transit time restrictions [Communication écrite]. 6th International Conference on Computational Logistics (ICCL 2015), Delft, Netherlands. Lien externe
Cherkesly, M., Desaulniers, G., & Laporte, G. (2015). Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. Transportation Science, 49(4), 752-766. Lien externe
Cherkesly, M., Desaulniers, G., & Laporte, G. (2015). A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Computers and Operations Research, 62, 23-35. Lien externe
Contardo, C., Desaulniers, G., & Lessard, F. (2015). Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks, 65(1), 88-99. Lien externe
De La Poix De Freminville, P., Desaulniers, G., Rousseau, L.-M., & Perron, S. (2015). A column generation heuristic for districting the price of a financial product. Journal of the Operational Research Society, 66(6), 965-978. Lien externe
Lehouillier, T., Nasri, M. I., Omer, J., Soumis, F., & Desaulniers, G. (2015). Solving the air conflict resolution problem under uncertainty as an iterative bi-objective mixed integer linear program. (Rapport technique n° G-2015-111). Lien externe
Lehouillier, T., Omer, J., Soumis, F., & Desaulniers, G. (mai 2015). A new variant of the minimum-weight maximum-cardinality clique problem to solve conflicts between aircraft [Communication écrite]. 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2015), Metz, France. Lien externe
Rakke, J. G., Andersson, H., Christiansen, M., & Desaulniers, G. (2015). A new formulation based on customer delivery patterns for a maritime inventory routing problem. Transportation Science, 49(2), 384-401. Lien externe
Spliet, R., & Desaulniers, G. (2015). The discrete time window assignment vehicle routing problem. European Journal of Operational Research, 244(2), 379-391. Lien externe
