Timo Gschwind

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 18

Top Topics

Lagrangean Relaxation

Vehicle Routing

Top Venues

Eur. J. Oper. Res.

Discret. Appl. Math.

INFORMS J. Comput.

Publications

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) (2024)
Julia Wahlen, Timo Gschwind
Branch-Price-and-Cut-Based Solution of Order Batching Problems. Transp. Sci. 57 (3) (2023)
Christian Becker, Jean Bertrand Gauthier, Timo Gschwind, Michael Schneider
In-depth analysis of granular local search for capacitated vehicle routing. Discret. Appl. Math. 329 (2023)
Marilène Cherkesly, Timo Gschwind
The pickup and delivery problem with time windows, multiple stacks, and handling operations. Eur. J. Oper. Res. 301 (2) (2022)
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) (2021)
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) (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)
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) (2019)
Timo Gschwind
Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem. OR Spectr. 41 (2) (2019)
Timo Gschwind, Michael Drexl
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem. Transp. Sci. 53 (2) (2019)
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 (2019)
Michael Schneider, Timo Gschwind, Daniele Vigo
Advances in vehicle routing and logistics optimization: exact methods. EURO J. Transp. Logist. 8 (2) (2019)
Katrin Heßler, Timo Gschwind, Stefan Irnich
Stabilized branch-and-price algorithms for vector packing problems. Eur. J. Oper. Res. 271 (2) (2018)
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) (2018)
Timo Gschwind, Stefan Irnich, Isabel Podlinski
Maximum weight relaxed cliques and Russian Doll Search revisited. Discret. Appl. Math. 234 (2018)
Timo Gschwind, Stefan Irnich
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities. OR Spectr. 39 (2) (2017)
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) (2017)
Timo Gschwind, Stefan Irnich
Dual Inequalities for Stabilized Column Generation Revisited. INFORMS J. Comput. 28 (1) (2016)
Timo Gschwind
A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem. Eur. J. Oper. Res. 247 (1) (2015)
Timo Gschwind, Stefan Irnich
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem. Transp. Sci. 49 (2) (2015)
Timo Gschwind, Stefan Irnich
A note on symmetry reduction for circular traveling tournament problems. Eur. J. Oper. Res. 210 (2) (2011)