default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Drexl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]Michael Drexl:
On efficient testing of capacity constraints in pickup-and-delivery problems with trailers. 4OR 19(2): 289-307 (2021)- [j18]Michael Drexl:
On the one-to-one pickup-and-delivery problem with time windows and trailers. Central Eur. J. Oper. Res. 29(3): 1115-1162 (2021)
2010 – 2019
- 2019
- [j17]Christian Tilk
, Michael Drexl, Stefan Irnich:
Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. Eur. J. Oper. Res. 276(2): 549-565 (2019) - [j16]Timo Gschwind, Michael Drexl:
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem. Transp. Sci. 53(2): 480-491 (2019) - [j15]Nicola Bianchessi, Michael Drexl, Stefan Irnich:
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints. Transp. Sci. 53(4): 1067-1084 (2019) - 2018
- [j14]Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel:
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem. Transp. Sci. 52(2): 300-319 (2018) - [j13]Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich:
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows. Transp. Sci. 52(5): 1174-1190 (2018) - 2017
- [j12]Michael Schneider, Michael Drexl:
A survey of the standard location-routing problem. Ann. Oper. Res. 259(1-2): 389-414 (2017) - 2016
- [j11]Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich:
Branch-and-price-and-cut for a service network design and hub location problem. Eur. J. Oper. Res. 255(3): 935-947 (2016) - 2015
- [j10]Michael Drexl, Michael Schneider:
A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 241(2): 283-308 (2015) - 2014
- [j9]Michael Drexl:
On the generalized directed rural postman problem. J. Oper. Res. Soc. 65(8): 1143-1154 (2014) - [j8]Michael Drexl:
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks 63(1): 119-133 (2014) - [j7]Michael Drexl, Stefan Irnich:
Solving elementary shortest-path problems as mixed-integer programs. OR Spectr. 36(2): 281-296 (2014) - 2013
- [j6]Michael Drexl:
Applications of the vehicle routing problem with trailers and transshipments. Eur. J. Oper. Res. 227(2): 275-283 (2013) - [j5]Michael Drexl:
A note on the separation of subtour elimination constraints in elementary shortest path problems. Eur. J. Oper. Res. 229(3): 595-598 (2013) - 2012
- [j4]Michael Drexl:
Rich vehicle routing in theory and practice. Logist. Res. 5(1-2): 47-63 (2012) - [j3]Michael Drexl:
Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints. Transp. Sci. 46(3): 297-316 (2012) - 2010
- [j2]Michael Drexl, Eric Prescott-Gagnon:
Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers' rules. Logist. Res. 2(2): 79-96 (2010) - [j1]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)
Coauthor Index
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-04-24 22:45 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:
