default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuy Desaulniers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j111]Juliette Gerbaux, Guy Desaulniers
, Quentin Cappart:
A machine-learning-based column generation heuristic for electric bus scheduling. Comput. Oper. Res. 173: 106848 (2025)- [j110]Carl Perreault-Lafleur, Margarida Carvalho, Guy Desaulniers:
A stochastic integer programming approach to reserve staff scheduling with preferences. Int. Trans. Oper. Res. 32(1): 289-313 (2025) - 2024
- [j109]Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi:
An improved column-generation-based matheuristic for learning classification trees. Comput. Oper. Res. 165: 106579 (2024) - [j108]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): 173-183 (2024) - [j107]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Learning to repeatedly solve routing problems. Networks 83(3): 503-526 (2024) - [j106]Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui:
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment. J. Sched. 27(2): 165-182 (2024) - [c3]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: 17-33 - 2023
- [j105]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Machine-Learning-Based Arc Selection for Constrained Shortest Path Problems in Column Generation. INFORMS J. Optim. 5(2): 191-210 (2023) - [j104]Clément Altman, Guy Desaulniers, Fausto Errico:
The Fragility-Constrained Vehicle Routing Problem with Time Windows. Transp. Sci. 57(2): 552-572 (2023) - [i5]Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi:
Revisiting column-generation-based matheuristic for learning classification trees. CoRR abs/2308.11477 (2023) - 2022
- [j103]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: 105554 (2022) - [j102]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: 105870 (2022) - [j101]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): 1189-1201 (2022) - [j100]Luciano Costa, Claudio Contardo, Guy Desaulniers, Julian Yarkony:
Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows. INFORMS J. Comput. 34(2): 1141-1156 (2022) - [j99]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): 1157-1175 (2022) - [j98]Adil Tahir, Guy Desaulniers, Issmail El Hallaoui:
Integral Column Generation for Set Partitioning Problems with Side Constraints. INFORMS J. Comput. 34(4): 2313-2331 (2022) - [j97]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): 245-264 (2022) - [i4]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Machine-learning-based arc selection for constrained shortest path problems in column generation. CoRR abs/2201.02535 (2022) - [i3]Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi, Freddy Lécué:
Explainable prediction of Qcodes for NOTAMs using column generation. CoRR abs/2208.04955 (2022) - [i2]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Learning to repeatedly solve routing problems. CoRR abs/2212.08101 (2022) - 2021
- [j96]Mathijs van Zon, Guy Desaulniers:
The joint network vehicle routing game with optional customers. Comput. Oper. Res. 133: 105375 (2021) - [j95]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): 240-253 (2021) - [j94]Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui:
Real-time bi-objective personnel re-scheduling in the retail industry. Eur. J. Oper. Res. 293(1): 93-108 (2021) - [j93]Kevin Dalmeijer, Guy Desaulniers:
Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem. INFORMS J. Comput. 33(2): 495-510 (2021) - [j92]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): 436-455 (2021) - [j91]Luciano Costa, Claudio Contardo, Guy Desaulniers, Diego Pecin:
Selective arc-ng pricing for vehicle routing. Int. Trans. Oper. Res. 28(5): 2633-2690 (2021) - [j90]Alexis Bretin, Guy Desaulniers, Louis-Martin Rousseau:
The traveling salesman problem with time windows in postal services. J. Oper. Res. Soc. 72(2): 383-397 (2021) - [j89]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): 764-779 (2021) - [j88]Annelieke C. Baller, Said Dabia, Guy Desaulniers, Wout E. H. Dullaert:
The Inventory Routing Problem with Demand Moves. Oper. Res. Forum 2(1) (2021) - [j87]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): 251-286 (2021) - [j86]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Machine-Learning-Based Column Selection for Column Generation. Transp. Sci. 55(4): 815-831 (2021) - [j85]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): 1411-1429 (2021) - [i1]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 abs/2102.02292 (2021) - 2020
- [j84]Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui:
Real-time personnel re-scheduling after a minor disruption in the retail industry. Comput. Oper. Res. 120: 104952 (2020) - [j83]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): 100024 (2020) - [j82]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): 1051-1063 (2020) - [j81]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): 1040-1054 (2020) - [j80]Julian Yarkony, Yossiri Adulyasak, Maneesh Kumar Singh, Guy Desaulniers:
Data Association via Set Packing for Computer Vision Applications. INFORMS J. Optim. 2(3): 167-191 (2020) - [j79]Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider:
Routing electric vehicles with a single recharge per route. Networks 76(2): 187-205 (2020) - [j78]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) - [j77]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): 97-114 (2020) - [j76]David Franz Koza, Guy Desaulniers, Stefan Ropke:
Integrated Liner Shipping Network Design and Scheduling. Transp. Sci. 54(2): 512-533 (2020) - [j75]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): 1170-1188 (2020)
2010 – 2019
- 2019
- [j74]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): 325-357 (2019) - [j73]Guy Desaulniers, Diego Pecin, Claudio Contardo:
Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO J. Transp. Logist. 8(2): 147-168 (2019) - [j72]Adil Tahir, Guy Desaulniers, Issmail El Hallaoui:
Integral column generation for the set partitioning problem. EURO J. Transp. Logist. 8(5): 713-744 (2019) - [j71]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): 699-711 (2019) - [j70]Niels-Christian Fink Bagger, Guy Desaulniers, Jacques Desrosiers:
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. J. Sched. 22(2): 155-172 (2019) - [j69]Iman Dayarian, Guy Desaulniers:
A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products. Transp. Sci. 53(3): 829-849 (2019) - [j68]Luciano Costa, Claudio Contardo, Guy Desaulniers:
Exact Branch-Price-and-Cut Algorithms for Vehicle Routing. Transp. Sci. 53(4): 946-985 (2019) - 2018
- [j67]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): 223-251 (2018) - [j66]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): 534-547 (2018) - 2017
- [j65]Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res. 77: 127-140 (2017) - [j64]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: 159-172 (2017) - [j63]Claudia Archetti, Guy Desaulniers, M. Grazia Speranza:
Minimizing the logistic ratio in the inventory routing problem. EURO J. Transp. Logist. 6(4): 289-306 (2017) - [j62]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): 696-712 (2017) - [j61]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): 489-502 (2017) - [j60]Hocine Bouarab, Guy Desaulniers, Jacques Desrosiers, Jean Bertrand Gauthier:
Linear fractional approximations for master problems in column generation. Oper. Res. Lett. 45(5): 503-507 (2017) - [j59]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): 1242-1258 (2017) - 2016
- [j58]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): 55-66 (2016) - [j57]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): 782-793 (2016) - [j56]Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider:
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. Oper. Res. 64(6): 1388-1405 (2016) - [j55]Guy Desaulniers, Jørgen Glomvik Rakke, Leandro C. Coelho:
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem. Transp. Sci. 50(3): 1060-1076 (2016) - 2015
- [j54]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: 23-35 (2015) - [j53]Remy Spliet, Guy Desaulniers:
The discrete time window assignment vehicle routing problem. Eur. J. Oper. Res. 244(2): 379-391 (2015) - [j52]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): 965-978 (2015) - [j51]Claudio Contardo, Guy Desaulniers, François Lessard:
Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks 65(1): 88-99 (2015) - [j50]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): 384-401 (2015) - [j49]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): 752-766 (2015) - [c2]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: 195-208 - [c1]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: 3-14 - 2014
- [j48]Charles Gauvin, Guy Desaulniers, Michel Gendreau:
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 50: 141-153 (2014) - [j47]Stephen J. Maher, Guy Desaulniers, François Soumis:
Recoverable robust single day aircraft maintenance routing problem. Comput. Oper. Res. 51: 130-145 (2014) - [j46]David Lasalle Ialongo, Guy Desaulniers:
Airline fleet assignment with internal passenger flow reevaluations. EURO J. Transp. Logist. 3(2): 121-142 (2014) - [j45]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): 677-708 (2014) - [j44]Mounira Groiez, Guy Desaulniers, Odile Marcotte:
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem. INFOR Inf. Syst. Oper. Res. 52(4): 185-196 (2014) - [j43]Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis:
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. Networks 63(1): 34-45 (2014) - [p4]Guy Desaulniers, Oli B. G. Madsen, Stefan Ropke:
The Vehicle Routing Problem with Time Windows. Vehicle Routing 2014: 119-159 - 2013
- [j42]Mohammed Saddoune, Guy Desaulniers, François Soumis:
Aircrew pairings with possible repetitions of the same flight number. Comput. Oper. Res. 40(3): 805-814 (2013) - [j41]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): 283-312 (2013) - [j40]Quentin Lequy, Guy Desaulniers, Marius M. Solomon:
Assigning Team Tasks and Multiple Activities to Fixed Work Shifts. INFOR Inf. Syst. Oper. Res. 51(2): 64-75 (2013) - [j39]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): 443-460 (2013) - 2012
- [j38]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): 831-841 (2012) - [j37]Glaydston Mattos Ribeiro, Guy Desaulniers, Jacques Desrosiers:
A branch-price-and-cut algorithm for the workover rig routing problem. Comput. Oper. Res. 39(12): 3305-3315 (2012) - [j36]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): 3361-3375 (2012) - [j35]Pascal Benchimol, Guy Desaulniers, Jacques Desrosiers:
Stabilized dynamic constraint aggregation for solving set partitioning problems. Eur. J. Oper. Res. 223(2): 360-371 (2012) - [j34]Quentin Lequy, Mathieu Bouchard, Guy Desaulniers, François Soumis, Beyime Tachefine:
Assigning multiple activities to work shifts. J. Sched. 15(2): 239-251 (2012) - [j33]Mohammed Saddoune, Guy Desaulniers, Issmail Elhallaoui, François Soumis:
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation. Transp. Sci. 46(1): 39-55 (2012) - 2011
- [j32]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): 445-454 (2011) - [j31]Issmail Elhallaoui, Abdelmoutalib Metrane, Guy Desaulniers, François Soumis:
An Improved Primal Simplex Algorithm for Degenerate Linear Programs. INFORMS J. Comput. 23(4): 569-577 (2011) - [j30]Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk:
Cutting planes for branch-and-price algorithms. Networks 58(4): 301-310 (2011) - [j29]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): 285-298 (2011) - 2010
- [j28]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): 341-349 (2010) - [j27]Simon Spoorendonk, Guy Desaulniers:
Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows. INFOR Inf. Syst. Oper. Res. 48(1): 53-67 (2010) - [j26]Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar:
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling. INFORMS J. Comput. 22(2): 297-313 (2010) - [j25]Guy Desaulniers:
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows. Oper. Res. 58(1): 179-192 (2010) - [j24]Issmail Elhallaoui, Abdelmoutalib Metrane, François Soumis, Guy Desaulniers:
Multi-phase dynamic constraint aggregation for set partitioning type problems. Math. Program. 123(2): 345-370 (2010) - [j23]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): 400-415 (2010) - [j22]Eric Prescott-Gagnon, Guy Desaulniers, Michael Drexl, Louis-Martin Rousseau:
European Driver Rules in Vehicle Routing with Time Windows. Transp. Sci. 44(4): 455-473 (2010) - [j21]Daniel Potthoff, Dennis Huisman, Guy Desaulniers:
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling. Transp. Sci. 44(4): 493-505 (2010)
2000 – 2009
- 2009
- [j20]Mathieu Bouchard, Alain Hertz, Guy Desaulniers:
Lower bounds and a tabu search algorithm for the minimum deficiency problem. J. Comb. Optim. 17(2): 168-191 (2009) - [j19]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): 190-204 (2009) - [j18]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): 17-30 (2009) - 2008
- [j17]Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib Metrane, François Soumis:
Bi-dynamic constraint aggregation and subproblem reduction. Comput. Oper. Res. 35(5): 1713-1724 (2008) - [j16]Guy Desaulniers, François Lessard, Ahmed Hadjar:
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows. Transp. Sci. 42(3): 387-404 (2008) - 2007
- [j15]Guy Desaulniers:
Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation. Comput. Oper. Res. 34(4): 1221-1239 (2007) - [j14]Mohamed Hamdouni, Guy Desaulniers, François Soumis:
Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches. Comput. Oper. Res. 34(11): 3362-3379 (2007) - [j13]Mohamed Hamdouni, François Soumis, Guy Desaulniers:
Parking buses in a depot with stochastic arrival times. Eur. J. Oper. Res. 183(2): 502-515 (2007) - [j12]Heykel Achour, Michel Gamache, François Soumis, Guy Desaulniers:
An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry. Transp. Sci. 41(3): 354-365 (2007) - [p3]Guy Desaulniers, Mark D. Hickman:
Chapter 2 Public Transit. Transportation 2007: 69-127 - 2006
- [j11]Nicolas Bélanger, Guy Desaulniers, François Soumis, Jacques Desrosiers:
Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues. Eur. J. Oper. Res. 175(3): 1754-1766 (2006) - [j10]Mohamed Hamdouni, Guy Desaulniers, Odile Marcotte, François Soumis, Marianne van Putten:
Dispatching Buses in a Depot Using Block Patterns. Transp. Sci. 40(3): 364-377 (2006) - 2005
- [j9]Daniel Villeneuve, Guy Desaulniers:
The shortest path problem with forbidden paths. Eur. J. Oper. Res. 165(1): 97-107 (2005) - [j8]Issmail Elhallaoui, Daniel Villeneuve, François Soumis, Guy Desaulniers:
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation. Oper. Res. 53(4): 632-645 (2005) - 2004
- [j7]Marc Paquet, Alain Martel, Guy Desaulniers:
Including technology selection decisions in manufacturing network design models. Int. J. Comput. Integr. Manuf. 17(2): 117-125 (2004) - 2002
- [p2]Jean-François Cordeau, Guy Desaulniers, Jacques Desrosiers, Marius M. Solomon, François Soumis:
VRP with Time Windows. The Vehicle Routing Problem 2002: 157-193 - [p1]Guy Desaulniers, Jacques Desrosiers, Andreas Erdmann, Marius M. Solomon, François Soumis:
VRP with Pickup and Delivery. The Vehicle Routing Problem 2002: 225-242 - 2001
- [j6]Knut Haase, Guy Desaulniers, Jacques Desrosiers:
Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems. Transp. Sci. 35(3): 286-303 (2001) - 2000
- [j5]Guy Desaulniers, Daniel Villeneuve:
The Shortest Path Problem with Time Windows and Linear Waiting Costs. Transp. Sci. 34(3): 312-319 (2000)
1990 – 1999
- 1998
- [j4]Guy Desaulniers, June Lavigne, François Soumis:
Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. 111(3): 479-494 (1998) - [j3]Guy Desaulniers, François Soumis, Jean-Charles Laurent:
A Shortest Path Algorithm for a Carlike Robot in a Polygonal Environment. Int. J. Robotics Res. 17(5): 512-530 (1998) - 1996
- [j2]Guy Desaulniers:
On shortest paths for a car-like robot maneuvering around obstacles. Robotics Auton. Syst. 17(3): 139-148 (1996) - 1995
- [j1]Guy Desaulniers, François Soumis:
An efficient algorithm to find a shortest path for a car-like robot. IEEE Trans. Robotics Autom. 11(6): 819-828 (1995)
Coauthor Index
Issmail Elhallaoui
aka: Issmail El Hallaoui
aka: Issmail El Hallaoui
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
