Guy Desaulniers

According to our database1, Guy Desaulniers authored at least 105 papers between 1995 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows.
Transp. Sci., 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

Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows.
INFORMS J. Comput., 2022

Machine-learning-based arc selection for constrained shortest path problems in column generation.
CoRR, 2022

Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering.
Comput. Oper. Res., 2022

2021
An Improved Integral Column Generation Algorithm Using Machine Learning for Aircrew Pairing.
Transp. Sci., 2021

Machine-Learning-Based Column Selection for Column Generation.
Transp. Sci., 2021

Preference-based and cyclic bus driver rostering problem with fixed days off.
Public Transp., 2021

Integrated and sequential solution methods for the cyclic bus driver rostering problem.
J. Oper. Res. Soc., 2021

The traveling salesman problem with time windows in postal services.
J. Oper. Res. Soc., 2021

Selective arc-ng pricing for vehicle routing.
Int. Trans. Oper. Res., 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

Accelerating Benders decomposition for short-term hydropower maintenance scheduling.
Eur. J. Oper. Res., 2021

Real-time bi-objective personnel re-scheduling in the retail industry.
Eur. J. Oper. Res., 2021

Predicting the probability distribution of bus travel time to move towards reliable planning of public transport services.
CoRR, 2021

The joint network vehicle routing game with optional customers.
Comput. Oper. Res., 2021

2020
Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem.
Transp. Sci., 2020

Integrated Liner Shipping Network Design and Scheduling.
Transp. Sci., 2020

Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models.
Transp. Sci., 2020

Routing electric vehicles with a single recharge per route.
Networks, 2020

A branch-and-price heuristic for the crew pairing problem with language constraints.
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

Real-time personnel re-scheduling after a minor disruption in the retail industry.
Comput. Oper. Res., 2020

2019
A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products.
Transp. Sci., 2019

Exact Branch-Price-and-Cut Algorithms for Vehicle Routing.
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

Integral column generation for the set partitioning problem.
EURO J. Transp. Logist., 2019

Selective pricing in branch-price-and-cut algorithms for vehicle routing.
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

The vehicle routing problem with hard time windows and stochastic service times.
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

Linear fractional approximations for master problems in column generation.
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

Minimizing the logistic ratio in the inventory routing problem.
EURO J. Transp. Logist., 2017

The pickup and delivery problem with time windows and handling operations.
Comput. Oper. Res., 2017

A new heuristic branching scheme for the crew pairing problem with base constraints.
Comput. Oper. Res., 2017

2016
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem.
Transp. Sci., 2016

Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows.
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

A column generation heuristic for districting the price of a financial product.
J. Oper. Res. Soc., 2015

The discrete time window assignment vehicle routing problem.
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

Valid Inequalities and Separation Algorithms for the Set Partitioning Problem.
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

Airline fleet assignment with internal passenger flow reevaluations.
EURO J. Transp. Logist., 2014

Recoverable robust single day aircraft maintenance routing problem.
Comput. Oper. Res., 2014

A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands.
Comput. Oper. Res., 2014

The Vehicle Routing Problem with Time Windows.
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

Assigning Team Tasks and Multiple Activities to Fixed Work Shifts.
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

Aircrew pairings with possible repetitions of the same flight number.
Comput. Oper. Res., 2013

2012
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation.
Transp. Sci., 2012

Assigning multiple activities to work shifts.
J. Sched., 2012

Stabilized dynamic constraint aggregation for solving set partitioning problems.
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

A branch-price-and-cut algorithm for the workover rig routing problem.
Comput. Oper. Res., 2012

A two-stage heuristic for multi-activity and task assignment to work shifts.
Comput. Ind. Eng., 2012

2011
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows.
Transp. Sci., 2011

Cutting planes for branch-and-price algorithms.
Networks, 2011

An Improved Primal Simplex Algorithm for Degenerate Linear Programs.
INFORMS J. Comput., 2011

Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods.
Eur. J. Oper. Res., 2011

2010
European Driver Rules in Vehicle Routing with Time Windows.
Transp. Sci., 2010

Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling.
Transp. Sci., 2010

A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem.
Transp. Sci., 2010

Multi-phase dynamic constraint aggregation for set partitioning type problems.
Math. Program., 2010

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows.
Oper. Res., 2010

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling.
INFORMS J. Comput., 2010

Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows.
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
A comparison of five heuristics for the multiple depot vehicle scheduling problem.
J. Sched., 2009

A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows.
Networks, 2009

Lower bounds and a tabu search algorithm for the minimum deficiency problem.
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

Bi-dynamic constraint aggregation and subproblem reduction.
Comput. Oper. Res., 2008

2007
An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry.
Transp. Sci., 2007

Parking buses in a depot with stochastic arrival times.
Eur. J. Oper. Res., 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

Chapter 2 Public Transit.
Proceedings of the Transportation, 2007

2006
Dispatching Buses in a Depot Using Block Patterns.
Transp. Sci., 2006

Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues.
Eur. J. Oper. Res., 2006

2005
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation.
Oper. Res., 2005

The shortest path problem with forbidden paths.
Eur. J. Oper. Res., 2005

2004
Including technology selection decisions in manufacturing network design models.
Int. J. Comput. Integr. Manuf., 2004

2002
VRP with Pickup and Delivery.
Proceedings of the Vehicle Routing Problem., 2002

VRP with Time Windows.
Proceedings of the Vehicle Routing Problem., 2002

2001
Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems.
Transp. Sci., 2001

2000
The Shortest Path Problem with Time Windows and Linear Waiting Costs.
Transp. Sci., 2000

1998
A Shortest Path Algorithm for a Carlike Robot in a Polygonal Environment.
Int. J. Robotics Res., 1998

Multi-depot vehicle scheduling problems with time windows and waiting costs.
Eur. J. Oper. Res., 1998

1996
On shortest paths for a car-like robot maneuvering around obstacles.
Robotics Auton. Syst., 1996

1995
An efficient algorithm to find a shortest path for a car-like robot.
IEEE Trans. Robotics Autom., 1995


  Loading...