default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimo Gschwind
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Nicola Bianchessi
, Timo Gschwind, Stefan Irnich:
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS J. Comput. 36(1): 224-244 (2024)- [j22]Stefan Faldum, Sarah Machate, Timo Gschwind, Stefan Irnich:
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff. OR Spectr. 46(4): 1063-1097 (2024) - [j21]Marjolein Aerts-Veenstra, Marilène Cherkesly, Timo Gschwind:
A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems. Transp. Sci. 58(5): 1121-1142 (2024) - 2023
- [j20]Christian Becker, Jean Bertrand Gauthier, Timo Gschwind, Michael Schneider:
In-depth analysis of granular local search for capacitated vehicle routing. Discret. Appl. Math. 329: 61-86 (2023) - [j19]Julia Wahlen, Timo Gschwind:
Branch-Price-and-Cut-Based Solution of Order Batching Problems. Transp. Sci. 57(3): 756-777 (2023) - 2022
- [j18]Marilène Cherkesly, Timo Gschwind:
The pickup and delivery problem with time windows, multiple stacks, and handling operations. Eur. J. Oper. Res. 301(2): 647-666 (2022) - 2021
- [j17]Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo:
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS J. Comput. 33(3): 1070-1090 (2021) - 2020
- [j16]Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde:
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. J. Sched. 23(3): 363-377 (2020) - [j15]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
- [j14]Dominik Goeke, Timo Gschwind, Michael Schneider:
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier. Discret. Appl. Math. 264: 43-61 (2019) - [j13]Michael Schneider, Timo Gschwind, Daniele Vigo:
Advances in vehicle routing and logistics optimization: exact methods. EURO J. Transp. Logist. 8(2): 117-118 (2019) - [j12]Timo Gschwind, Nicola Bianchessi, Stefan Irnich:
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur. J. Oper. Res. 278(1): 91-104 (2019) - [j11]Timo Gschwind:
Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem. OR Spectr. 41(2): 491-512 (2019) - [j10]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) - 2018
- [j9]Timo Gschwind, Stefan Irnich, Isabel Podlinski:
Maximum weight relaxed cliques and Russian Doll Search revisited. Discret. Appl. Math. 234: 131-138 (2018) - [j8]Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk:
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. Eur. J. Oper. Res. 266(2): 521-530 (2018) - [j7]Katrin Heßler, Timo Gschwind, Stefan Irnich:
Stabilized branch-and-price algorithms for vector packing problems. Eur. J. Oper. Res. 271(2): 401-419 (2018) - 2017
- [j6]Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, Stefan Irnich:
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur. J. Oper. Res. 261(2): 530-539 (2017) - [j5]Timo Gschwind, Stefan Irnich:
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities. OR Spectr. 39(2): 541-556 (2017) - 2016
- [j4]Timo Gschwind, Stefan Irnich:
Dual Inequalities for Stabilized Column Generation Revisited. INFORMS J. Comput. 28(1): 175-194 (2016) - 2015
- [j3]Timo Gschwind:
A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem. Eur. J. Oper. Res. 247(1): 60-71 (2015) - [j2]Timo Gschwind, Stefan Irnich:
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem. Transp. Sci. 49(2): 335-354 (2015) - 2011
- [j1]Timo Gschwind, Stefan Irnich:
A note on symmetry reduction for circular traveling tournament problems. Eur. J. Oper. Res. 210(2): 452-456 (2011)
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-11-07 21:35 CET 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:
