![]() | Up a level |
Boubaker, K., Desaulniers, G., & El Hallaoui, I. (2008). Bidline Scheduling with Equity by Heuristic Dynamic Constraint Aggregation. (Technical Report n° G-2008-43). External link
Desaulniers, G. (2008). Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. (Technical Report n° G-2008-32). External link
Desaulniers, G., Lessard, F., & Hadjar, A. (2008). Tabu Search, Partial Elementarity, and Generalized K-Path Inequalities for the Vehicle Routing Problem With Time Windows. Transportation Science, 42(3), 387-404. External link
El Hallaoui, I., Desaulniers, G., Metrane, A., & Soumis, F. (2008). Bi-dynamic constraint aggregation and subproblem reduction. Computers & Operations Research, 35(5), 1713-1724. External link
Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2008). A Branch-and-Price-and-Cut Method for a Liquefied Natural Gas Inventory Routing Problem. (Technical Report n° G-2008-49). External link
Potthoff, D., Huisman, D., & Desaulniers, G. (2008). Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling. (Technical Report n° G-2008-87). External link
Spoorendonk, S., & Desaulniers, G. (2008). Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows. (Technical Report n° G-2008-72). External link