Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers' rules. - Michael Drexl; Eric Prescott-Gagnon (Logist. Res., 2010)

European Driver Rules in Vehicle Routing with Time Windows. - Eric Prescott-Gagnon; Guy Desaulniers; Michael Drexl; Louis-Martin Rousseau (Transp. Sci., 2010)

Rich vehicle routing in theory and practice. - Michael Drexl (Logist. Res., 2012)

Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints. - Michael Drexl (Transp. Sci., 2012)

A note on the separation of subtour elimination constraints in elementary shortest path problems. - Michael Drexl (Eur. J. Oper. Res., 2013)

Applications of the vehicle routing problem with trailers and transshipments. - Michael Drexl (Eur. J. Oper. Res., 2013)

On the generalized directed rural postman problem. - Michael Drexl (J. Oper. Res. Soc., 2014)

Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. - Michael Drexl (Networks, 2014)

Solving elementary shortest-path problems as mixed-integer programs. - Michael Drexl; Stefan Irnich (OR Spectr., 2014)

A survey of variants and extensions of the location-routing problem. - Michael Drexl; Michael Schneider 004 (Eur. J. Oper. Res., 2015)

Branch-and-price-and-cut for a service network design and hub location problem. - Ann-Kathrin Rothenbächer; Michael Drexl; Stefan Irnich (Eur. J. Oper. Res., 2016)

A survey of the standard location-routing problem. - Michael Schneider 004; Michael Drexl (Ann. Oper. Res., 2017)

Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows. - Ann-Kathrin Rothenbächer; Michael Drexl; Stefan Irnich (Transp. Sci., 2018)

Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem. - Christian Tilk; Nicola Bianchessi; Michael Drexl; Stefan Irnich; Frank Meisel (Transp. Sci., 2018)

Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. - Christian Tilk; Michael Drexl; Stefan Irnich (Eur. J. Oper. Res., 2019)

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints. - Nicola Bianchessi; Michael Drexl; Stefan Irnich (Transp. Sci., 2019)

Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem. - Timo Gschwind; Michael Drexl (Transp. Sci., 2019)

On efficient testing of capacity constraints in pickup-and-delivery problems with trailers. - Michael Drexl (4OR, 2021)

On the one-to-one pickup-and-delivery problem with time windows and trailers. - Michael Drexl (Central Eur. J. Oper. Res., 2021)