Guy Desaulniers

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 69

Top Venues

Transp. Sci.

Eur. J. Oper. Res.

Comput. Oper. Res.

EURO J. Transp. Logist.

Publications

Mathis Azéma, Guy Desaulniers, Jorge E. Mendoza, Gilles Pesant
A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints. CPAIOR (1) (2024)
Mouad Morabit, Guy Desaulniers, Andrea Lodi
Learning to repeatedly solve routing problems. Networks 83 (3) (2024)
Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi, Freddy Lécué
Explainable prediction of Qcodes for NOTAMs using column generation. J. Oper. Res. Soc. 75 (1) (2024)
Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi
An improved column-generation-based matheuristic for learning classification trees. Comput. Oper. Res. 165 (2024)
Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment. J. Sched. 27 (2) (2024)
Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi
Revisiting column-generation-based matheuristic for learning classification trees. CoRR (2023)
Clément Altman, Guy Desaulniers, Fausto Errico
The Fragility-Constrained Vehicle Routing Problem with Time Windows. Transp. Sci. 57 (2) (2023)
Mouad Morabit, Guy Desaulniers, Andrea Lodi
Machine-Learning-Based Arc Selection for Constrained Shortest Path Problems in Column Generation. INFORMS J. Optim. 5 (2) (2023)
Adil Tahir, Guy Desaulniers, Issmail El Hallaoui
Integral Column Generation for Set Partitioning Problems with Side Constraints. INFORMS J. Comput. 34 (4) (2022)
Jørgen Skålnes, Henrik Andersson, Guy Desaulniers, Magnus Stålhane
An improved formulation for the inventory routing problem with time-varying demands. Eur. J. Oper. Res. 302 (3) (2022)
Edward Lam, Guy Desaulniers, Peter J. Stuckey
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations. Comput. Oper. Res. 145 (2022)
Mouad Morabit, Guy Desaulniers, Andrea Lodi
Learning to repeatedly solve routing problems. CoRR (2022)
Tayeb Mhamedi, Henrik Andersson, Marilène Cherkesly, Guy Desaulniers
A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows. Transp. Sci. 56 (1) (2022)
Alexander Jungwirth, Guy Desaulniers, Markus M. Frey, Rainer Kolisch
Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity. INFORMS J. Comput. 34 (2) (2022)
Luciano Costa, Claudio Contardo, Guy Desaulniers, Julian Yarkony
Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows. INFORMS J. Comput. 34 (2) (2022)
Frédéric Quesnel, Alice Wu, Guy Desaulniers, François Soumis
Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering. Comput. Oper. Res. 138 (2022)
Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi, Freddy Lécué
Explainable prediction of Qcodes for NOTAMs using column generation. CoRR (2022)
Mouad Morabit, Guy Desaulniers, Andrea Lodi
Machine-learning-based arc selection for constrained shortest path problems in column generation. CoRR (2022)
Safae Er-Rbib, Guy Desaulniers, Issmail Elhallaoui, Patrick Munroe
Preference-based and cyclic bus driver rostering problem with fixed days off. Public Transp. 13 (2) (2021)
Kevin Dalmeijer, Guy Desaulniers
Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem. INFORMS J. Comput. 33 (2) (2021)
Mathijs van Zon, Guy Desaulniers
The joint network vehicle routing game with optional customers. Comput. Oper. Res. 133 (2021)
Alexis Bretin, Guy Desaulniers, Louis-Martin Rousseau
The traveling salesman problem with time windows in postal services. J. Oper. Res. Soc. 72 (2) (2021)
Léa Ricard, Guy Desaulniers, Andrea Lodi, Louis-Martin Rousseau
Predicting the probability distribution of bus travel time to move towards reliable planning of public transport services. CoRR (2021)
Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui
Real-time bi-objective personnel re-scheduling in the retail industry. Eur. J. Oper. Res. 293 (1) (2021)
Luciano Costa, Claudio Contardo, Guy Desaulniers, Diego Pecin
Selective arc-ng pricing for vehicle routing. Int. Trans. Oper. Res. 28 (5) (2021)
Borzou Rostami, Guy Desaulniers, Fausto Errico, Andrea Lodi
Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times. Oper. Res. 69 (2) (2021)
Mouad Morabit, Guy Desaulniers, Andrea Lodi
Machine-Learning-Based Column Selection for Column Generation. Transp. Sci. 55 (4) (2021)
Safae Er-Rbib, Guy Desaulniers, Issmail El Hallaoui, Abderrahman Bani
Integrated and sequential solution methods for the cyclic bus driver rostering problem. J. Oper. Res. Soc. 72 (4) (2021)
Annelieke C. Baller, Said Dabia, Guy Desaulniers, Wout E. H. Dullaert
The Inventory Routing Problem with Demand Moves. Oper. Res. Forum 2 (1) (2021)
Adil Tahir, Frédéric Quesnel, Guy Desaulniers, Issmail El Hallaoui, Yassine Yaakoubi
An Improved Integral Column Generation Algorithm Using Machine Learning for Aircrew Pairing. Transp. Sci. 55 (6) (2021)
Jesús A. Rodríguez, Miguel F. Anjos, Pascal Côté, Guy Desaulniers
Accelerating Benders decomposition for short-term hydropower maintenance scheduling. Eur. J. Oper. Res. 289 (1) (2021)
Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui
Real-time personnel re-scheduling after a minor disruption in the retail industry. Comput. Oper. Res. 120 (2020)
Frédéric Quesnel, Guy Desaulniers, François Soumis
Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem. Transp. Sci. 54 (1) (2020)
Julian Yarkony, Yossiri Adulyasak, Maneesh Kumar Singh, Guy Desaulniers
Data Association via Set Packing for Computer Vision Applications. INFORMS J. Optim. 2 (3) (2020)
David Franz Koza, Guy Desaulniers, Stefan Ropke
Integrated Liner Shipping Network Design and Scheduling. Transp. Sci. 54 (2) (2020)
Guy Desaulniers, François Lessard, Mohammed Saddoune, François Soumis
Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems. Oper. Res. Forum 1 (3) (2020)
Sana Dahmen, Monia Rekik, François Soumis, Guy Desaulniers
A two-stage solution approach for personalized multi-department multi-day shift scheduling. Eur. J. Oper. Res. 280 (3) (2020)
Frédéric Quesnel, Guy Desaulniers, François Soumis
A branch-and-price heuristic for the crew pairing problem with language constraints. Eur. J. Oper. Res. 283 (3) (2020)
Claudia Archetti, Jean-François Cordeau, Guy Desaulniers
Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling. EURO J. Transp. Logist. 9 (4) (2020)
Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider
Routing electric vehicles with a single recharge per route. Networks 76 (2) (2020)
Guy Desaulniers, Timo Gschwind, Stefan Irnich
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models. Transp. Sci. 54 (5) (2020)
Dalia Attia, Reinhard Bürgy, Guy Desaulniers, François Soumis
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. EURO J. Comput. Optim. 7 (4) (2019)
Guy Desaulniers, Diego Pecin, Claudio Contardo
Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO J. Transp. Logist. 8 (2) (2019)
Adil Tahir, Guy Desaulniers, Issmail El Hallaoui
Integral column generation for the set partitioning problem. EURO J. Transp. Logist. 8 (5) (2019)
Iman Dayarian, Guy Desaulniers
A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products. Transp. Sci. 53 (3) (2019)
Martin Fink, Guy Desaulniers, Markus M. Frey, Ferdinand Kiermaier, Rainer Kolisch, François Soumis
Column generation for vehicle routing problems with multiple synchronization constraints. Eur. J. Oper. Res. 272 (2) (2019)
Luciano Costa, Claudio Contardo, Guy Desaulniers
Exact Branch-Price-and-Cut Algorithms for Vehicle Routing. Transp. Sci. 53 (4) (2019)
Niels-Christian F. Bagger, Guy Desaulniers, Jacques Desrosiers
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. J. Sched. 22 (2) (2019)
Fausto Errico, Guy Desaulniers, Michel Gendreau, Walter Rei, Louis-Martin Rousseau
The vehicle routing problem with hard time windows and stochastic service times. EURO J. Transp. Logist. 7 (3) (2018)
Stephen J. Maher, Guy Desaulniers, François Soumis
The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints. Eur. J. Oper. Res. 264 (2) (2018)
Thibault Lehouillier, Moncef Ilies Nasri, François Soumis, Guy Desaulniers, Jérémy Omer
Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach. Transp. Sci. 51 (4) (2017)
Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte
The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res. 77 (2017)
Thibault Lehouillier, Jérémy Omer, François Soumis, Guy Desaulniers
Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem. Eur. J. Oper. Res. 256 (3) (2017)
Claudia Archetti, Guy Desaulniers, M. Grazia Speranza
Minimizing the logistic ratio in the inventory routing problem. EURO J. Transp. Logist. 6 (4) (2017)
Diego Pecin, Claudio Contardo, Guy Desaulniers, Eduardo Uchoa
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 29 (3) (2017)
Frédéric Quesnel, Guy Desaulniers, François Soumis
A new heuristic branching scheme for the crew pairing problem with base constraints. Comput. Oper. Res. 80 (2017)
Hocine Bouarab, Guy Desaulniers, Jacques Desrosiers, Jean Bertrand Gauthier
Linear fractional approximations for master problems in column generation. Oper. Res. Lett. 45 (5) (2017)
Guy Desaulniers, Jørgen Glomvik Rakke, Leandro C. Coelho
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem. Transp. Sci. 50 (3) (2016)
Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250 (3) (2016)
Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. Oper. Res. 64 (6) (2016)
Fausto Errico, Guy Desaulniers, Michel Gendreau, Walter Rei, Louis-Martin Rousseau
A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur. J. Oper. Res. 249 (1) (2016)
Thibault Lehouillier, Jérémy Omer, François Soumis, Guy Desaulniers
A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft. MCO (1) (2015)
Pierre de la Poix de Fréminville, Guy Desaulniers, Louis-Martin Rousseau, Sylvain Perron
A column generation heuristic for districting the price of a financial product. J. Oper. Res. Soc. 66 (6) (2015)
Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62 (2015)
Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. Transp. Sci. 49 (4) (2015)
Remy Spliet, Guy Desaulniers
The discrete time window assignment vehicle routing problem. Eur. J. Oper. Res. 244 (2) (2015)
Berit Dangaard Brouer, Guy Desaulniers, Christian Vad Karsten, David Pisinger
A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions. ICCL (2015)
Claudio Contardo, Guy Desaulniers, François Lessard
Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks 65 (1) (2015)
Jørgen Glomvik Rakke, Henrik Andersson, Marielle Christiansen, Guy Desaulniers
A New Formulation Based on Customer Delivery Patterns for a Maritime Inventory Routing Problem. Transp. Sci. 49 (2) (2015)
Charles Gauvin, Guy Desaulniers, Michel Gendreau
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 50 (2014)
David Lasalle Ialongo, Guy Desaulniers
Airline fleet assignment with internal passenger flow reevaluations. EURO J. Transp. Logist. 3 (2) (2014)
Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis
-vehicle windy rural postman problem. Networks 63 (1) (2014)
Stephen J. Maher, Guy Desaulniers, François Soumis
Recoverable robust single day aircraft maintenance routing problem. Comput. Oper. Res. 51 (2014)
Mounira Groiez, Guy Desaulniers, Odile Marcotte
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem. INFOR Inf. Syst. Oper. Res. 52 (4) (2014)
Glaydston Mattos Ribeiro, Guy Desaulniers, Jacques Desrosiers, Thibaut Vidal, Bruno Salezze Vieira
Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon. J. Heuristics 20 (6) (2014)
Quentin Lequy, Guy Desaulniers, Marius M. Solomon
Assigning Team Tasks and Multiple Activities to Fixed Work Shifts. INFOR Inf. Syst. Oper. Res. 51 (2) (2013)
Mohammed Saddoune, Guy Desaulniers, François Soumis
Aircrew pairings with possible repetitions of the same flight number. Comput. Oper. Res. 40 (3) (2013)
Mahsa Elahipanah, Guy Desaulniers, Ève Lacasse-Guay
A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts. J. Sched. 16 (5) (2013)
Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem. EURO J. Comput. Optim. 1 (3-4) (2013)
Magnus Stålhane, Henrik Andersson, Marielle Christiansen, Jean-François Cordeau, Guy Desaulniers
A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Comput. Oper. Res. 39 (12) (2012)
Glaydston Mattos Ribeiro, Guy Desaulniers, Jacques Desrosiers
A branch-price-and-cut algorithm for the workover rig routing problem. Comput. Oper. Res. 39 (12) (2012)
Mohammed Saddoune, Guy Desaulniers, Issmail Elhallaoui, François Soumis
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation. Transp. Sci. 46 (1) (2012)
Pascal Benchimol, Guy Desaulniers, Jacques Desrosiers
Stabilized dynamic constraint aggregation for solving set partitioning problems. Eur. J. Oper. Res. 223 (2) (2012)
Quentin Lequy, Mathieu Bouchard, Guy Desaulniers, François Soumis, Beyime Tachefine
Assigning multiple activities to work shifts. J. Sched. 15 (2) (2012)
Quentin Lequy, Guy Desaulniers, Marius M. Solomon
A two-stage heuristic for multi-activity and task assignment to work shifts. Comput. Ind. Eng. 63 (4) (2012)
Claudia Archetti, Mathieu Bouchard, Guy Desaulniers
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. Transp. Sci. 45 (3) (2011)
Mohammed Saddoune, Guy Desaulniers, Issmail Elhallaoui, François Soumis
Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods. Eur. J. Oper. Res. 212 (3) (2011)
Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk
Cutting planes for branch-and-price algorithms. Networks 58 (4) (2011)
Issmail Elhallaoui, Abdelmoutalib Metrane, Guy Desaulniers, François Soumis
An Improved Primal Simplex Algorithm for Degenerate Linear Programs. INFORMS J. Comput. 23 (4) (2011)
Simon Spoorendonk, Guy Desaulniers
Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows. INFOR Inf. Syst. Oper. Res. 48 (1) (2010)
Guy Desaulniers
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows. Oper. Res. 58 (1) (2010)
Issmail Elhallaoui, Abdelmoutalib Metrane, François Soumis, Guy Desaulniers
Multi-phase dynamic constraint aggregation for set partitioning type problems. Math. Program. 123 (2) (2010)
Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling. INFORMS J. Comput. 22 (2) (2010)
Roar Grønhaug, Marielle Christiansen, Guy Desaulniers, Jacques Desrosiers
A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem. Transp. Sci. 44 (3) (2010)
Eric Prescott-Gagnon, Guy Desaulniers, Michael Drexl, Louis-Martin Rousseau
European Driver Rules in Vehicle Routing with Time Windows. Transp. Sci. 44 (4) (2010)
Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Gilbert Laporte, Vladimir Marianov
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. Eur. J. Oper. Res. 206 (2) (2010)
Daniel Potthoff, Dennis Huisman, Guy Desaulniers
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling. Transp. Sci. 44 (4) (2010)
Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman
A comparison of five heuristics for the multiple depot vehicle scheduling problem. J. Sched. 12 (1) (2009)
Mathieu Bouchard, Alain Hertz, Guy Desaulniers
Lower bounds and a tabu search algorithm for the minimum deficiency problem. J. Comb. Optim. 17 (2) (2009)
Eric Prescott-Gagnon, Guy Desaulniers, Louis-Martin Rousseau
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54 (4) (2009)

Guy Desaulniers.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guy Desaulniers