Groupe d’études et de recherche en analyse des décisions

Publications

Guy Desaulniers

Articles

A Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products
et
À paraître dans : Transportation Science, 2018 référence BibTeX
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
, et
Computers & Operations Research, 50, 141–153, 2014 référence BibTeX
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
, , et
EURO Journal on Computational Optimization, 1(3-4), 283–312, 2013 référence BibTeX
Assigning multiple activities to work shifts
, , , et
Journal of Scheduling, 15(2), 239–251, 2012 référence BibTeX
Stabilized dynamic constraint aggregation for solving set partitioning problems
, et
European Journal of Operational Research, 223(2), 360–371, 2012 référence BibTeX
A branch-price-and-cut method for a ship routing and scheduling problem with split loads
, , , et
Computers & Operations Research, 39(12), 3361–3375, 2012 référence BibTeX
A branch-price-and-cut algorithm for the workover rig routing problem
, et
Computers & Operations Research, 39(12), 3305–3315, 2012 référence BibTeX
Enhanced branch-and-price-and-cut for vehicle routing with split deliveries and time windows
, et
Transportation Science, 45(3), 285–298, 2011 référence BibTeX
Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows
Operations Research, 58(1), 179–192, 2010 référence BibTeX
Clique inequalities applied to the vehicle routing problem with time windows
et
INFOR, 48(1), 53–67, 2010 référence BibTeX
European driver rules in vehicle routing with time windows
, , et
Transportation Science, 44(4), 455–473, 2010 référence BibTeX
A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
, , et
European Journal of Operational Research, 206(2), 341–349, 2010 référence BibTeX
A branch-and-price-and-cut method for a liquefied natural gas inventory routing problem
, , et
Transportation Science, 44(3), 400–415, 2010 référence BibTeX
Aircraft routing under different business processes
, et
Journal of Air Transport Management, 16(5), 258–263, 2010 référence BibTeX
Bidline scheduling with equity by heuristic dynamic constraint aggregation
, et
Transportation Research Part B: Methodological, 44(1), 50–61, 2010 référence BibTeX
Column generation with dynamic duty selection for railway crew rescheduling
, et
Transportation Science, 44(4), 493–505, 2010 référence BibTeX
Path reduced costs for eliminating arcs in routing and scheduling
, , et
INFORMS Journal on Computing, 22(2), 297–313, 2010 référence BibTeX
Comparison of heuristic approaches for the multiple depot vehicle scheduling problem
, , et
Journal of Scheduling, 12(1), 17–30, 2009 référence BibTeX
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
, et
Networks, 54(4), 190–204, 2009 référence BibTeX
Lower bounds and a Tabu search algorithm for the minimum deficiency problem
, et
Journal of Combinatorial Optimization, 17(2), 168–191, 2009 référence BibTeX
Tabu search, partial elementarity, and generalized \(k\)-path inequalities for the vehicle routing problem with time windows
, et
Transportation Science, 42(3), 387–404, 2008 référence BibTeX
Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches
, et
Computers & Operations Research, 34(11), 3362–3379, 2007 référence BibTeX
Parking buses in a depot with stochastic arrival times
, et
European Journal of Operational Research, 183(2), 502–515, 2007 référence BibTeX
Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation
Computers & Operations Research, 34(4), 1221–1239, 2007 référence BibTeX
An Extended Branch-and-Bound Method for Locomotive Assignment
, et
Transportation Research Part B: Methodological, 40(5), 404–423, 2006 référence BibTeX
Periodic airline fleet assignment with time windows, spacing donstraints, and time dependent revenues
, , et
European Journal of Operational Research, 175(3), 1754–1766, 2006 référence BibTeX
Dispatching and conflict-free routing of automated guided vehicles: An exact approach
, , et
International Journal of Flexible Manufacturing Systems, 15, 309–331, 2003 référence BibTeX

Livres

Chapitres de livre

The vehicle routing problem with time windows
, et
P. Toth, D. Vigo (eds.), Vehicle Routing: Problems, Methods and Applications, 2nd edition, SIAM, Philadelphia, 119–159, 2014 référence BibTeX
The vehicle routing problem with time windows : State-of-the-art exact solution methods
, et
J.J. Cochran, Wiley Encyclopedia of Operations Reseach and Management Science, 2011 référence BibTeX
Public transit
et
G. Laporte, C. Barnhart (eds), Handbooks in Operations Research and Management Science, Transportation, 14, 69–127, 2007 référence BibTeX
Shortest path problems with resource constraints
et
. Desaulniers, J. Desrosiers, M.M. Solomon (eds.), Column Generation, Springer, New York, 33–65, 2005 référence BibTeX

Actes de conférence

A flexible framework for solving the air conflict detection and resolution problem using maximum cliques in a graph
, , et
Proceedings of the 11th USA/Europe Air Traffic Management Research and Development Seminar, ATM 2015, 9 pages, 2015 référence BibTeX
A new variant of the minimumweight maximum-cardinality clique problem to solve con icts between aircraft
, , et
Modelling, Computation and Optimization in Information Systems and Management Sciences, Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2015 - Part I, Advances in Intelligent Systems and Computing, 3–14, 2015 référence BibTeX
A generic linear program for an optimal mine production plan
, et
Proceedings of Mine Planning and Equipment Select & Environmental Issues and Waste Management in Energy and Mineral Product, Banff, Canada, 326–334, 2009 référence BibTeX
A rolling horizon solution approach for the airline crew pairing problem
, et
Proceedings of the 2009 International Conference on Computers & Industrial Engineering, Troyes, France, 344–347, 2009 référence BibTeX