Guy Desaulniers
Orcid: 0000-0003-4469-9813
According to our database1,
Guy Desaulniers
authored at least 120 papers
between 1995 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
A stochastic integer programming approach to reserve staff scheduling with preferences.
Int. Trans. Oper. Res., January, 2025
Comput. Oper. Res., 2025
2024
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment.
J. Sched., April, 2024
J. Oper. Res. Soc., January, 2024
Comput. Oper. Res., 2024
A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024
2023
Machine-Learning-Based Arc Selection for Constrained Shortest Path Problems in Column Generation.
INFORMS J. Optim., April, 2023
Transp. Sci., March, 2023
CoRR, 2023
2022
A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows.
Transp. Sci., 2022
INFORMS J. Comput., 2022
Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity.
INFORMS J. Comput., 2022
INFORMS J. Comput., 2022
Eur. J. Oper. Res., 2022
Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering.
Comput. Oper. Res., 2022
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations.
Comput. Oper. Res., 2022
2021
An Improved Integral Column Generation Algorithm Using Machine Learning for Aircrew Pairing.
Transp. Sci., 2021
Public Transp., 2021
Integrated and sequential solution methods for the cyclic bus driver rostering problem.
J. Oper. Res. Soc., 2021
J. Oper. Res. Soc., 2021
Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times.
Oper. Res., 2021
Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem.
INFORMS J. Comput., 2021
Eur. J. Oper. Res., 2021
Eur. J. Oper. Res., 2021
Predicting the probability distribution of bus travel time to move towards reliable planning of public transport services.
CoRR, 2021
Comput. Oper. Res., 2021
2020
INFORMS J. Optim., July, 2020
Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem.
Transp. Sci., 2020
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models.
Transp. Sci., 2020
Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems.
Oper. Res. Forum, 2020
Eur. J. Oper. Res., 2020
A two-stage solution approach for personalized multi-department multi-day shift scheduling.
Eur. J. Oper. Res., 2020
Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling.
EURO J. Transp. Logist., 2020
Comput. Oper. Res., 2020
2019
A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products.
Transp. Sci., 2019
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem.
J. Sched., 2019
Column generation for vehicle routing problems with multiple synchronization constraints.
Eur. J. Oper. Res., 2019
EURO J. Transp. Logist., 2019
EURO J. Transp. Logist., 2019
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers.
EURO J. Comput. Optim., 2019
2018
The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints.
Eur. J. Oper. Res., 2018
EURO J. Transp. Logist., 2018
2017
Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach.
Transp. Sci., 2017
Oper. Res. Lett., 2017
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows.
INFORMS J. Comput., 2017
Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem.
Eur. J. Oper. Res., 2017
EURO J. Transp. Logist., 2017
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
2016
Transp. Sci., 2016
Oper. Res., 2016
A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times.
Eur. J. Oper. Res., 2016
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks.
Eur. J. Oper. Res., 2016
2015
A New Formulation Based on Customer Delivery Patterns for a Maritime Inventory Routing Problem.
Transp. Sci., 2015
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading.
Transp. Sci., 2015
Reaching the elementary lower bound in the vehicle routing problem with time windows.
Networks, 2015
J. Oper. Res. Soc., 2015
Eur. J. Oper. Res., 2015
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading.
Comput. Oper. Res., 2015
A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft.
Proceedings of the 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, 2015
A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions.
Proceedings of the Computational Logistics - 6th International Conference, 2015
2014
A branch-price-and-cut algorithm for the min-max <i>k</i>-vehicle windy rural postman problem.
Networks, 2014
INFOR Inf. Syst. Oper. Res., 2014
Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon.
J. Heuristics, 2014
EURO J. Transp. Logist., 2014
Comput. Oper. Res., 2014
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands.
Comput. Oper. Res., 2014
Proceedings of the Vehicle Routing, 2014
2013
A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts.
J. Sched., 2013
INFOR Inf. Syst. Oper. Res., 2013
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem.
EURO J. Comput. Optim., 2013
Comput. Oper. Res., 2013
2012
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation.
Transp. Sci., 2012
Eur. J. Oper. Res., 2012
A branch-price-and-cut method for a ship routing and scheduling problem with split loads.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
Comput. Ind. Eng., 2012
2011
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows.
Transp. Sci., 2011
INFORMS J. Comput., 2011
Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods.
Eur. J. Oper. Res., 2011
2010
Transp. Sci., 2010
Transp. Sci., 2010
Math. Program., 2010
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows.
Oper. Res., 2010
INFORMS J. Comput., 2010
INFOR Inf. Syst. Oper. Res., 2010
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.
Eur. J. Oper. Res., 2010
2009
J. Sched., 2009
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows.
Networks, 2009
J. Comb. Optim., 2009
2008
Tabu Search, Partial Elementarity, and Generalized <i>k</i>-Path Inequalities for the Vehicle Routing Problem with Time Windows.
Transp. Sci., 2008
2007
An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry.
Transp. Sci., 2007
Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches.
Comput. Oper. Res., 2007
Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation.
Comput. Oper. Res., 2007
2006
Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues.
Eur. J. Oper. Res., 2006
2005
Oper. Res., 2005
2004
Int. J. Comput. Integr. Manuf., 2004
2002
2001
Transp. Sci., 2001
2000
Transp. Sci., 2000
1998
Int. J. Robotics Res., 1998
Eur. J. Oper. Res., 1998
1996
Robotics Auton. Syst., 1996
1995
IEEE Trans. Robotics Autom., 1995