Timo Gschwind

According to our database, Timo Gschwind authored at least 21 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems.

Nicola Bianchessi, Timo Gschwind, Stefan Irnich

INFORMS J. Comput., 2024

2023

Branch-Price-and-Cut-Based Solution of Order Batching Problems.

Julia Wahlen, Timo Gschwind

Transp. Sci., May, 2023

In-depth analysis of granular local search for capacitated vehicle routing.

Christian Becker, Jean Bertrand Gauthier, Timo Gschwind, Michael Schneider

Discret. Appl. Math., April, 2023

2022

The pickup and delivery problem with time windows, multiple stacks, and handling operations.

Marilène Cherkesly, Timo Gschwind

Eur. J. Oper. Res., 2022

2021

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.

Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo

INFORMS J. Comput., 2021

2020

Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models.

Guy Desaulniers, Timo Gschwind, Stefan Irnich

Transp. Sci., 2020

Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network.

Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde

J. Sched., 2020

2019

Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem.

Timo Gschwind, Michael Drexl

Transp. Sci., 2019

Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem.

Timo Gschwind

OR Spectr., 2019

Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem.

Timo Gschwind, Nicola Bianchessi, Stefan Irnich

Eur. J. Oper. Res., 2019

Advances in vehicle routing and logistics optimization: exact methods.

Michael Schneider, Timo Gschwind, Daniele Vigo

EURO J. Transp. Logist., 2019

Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier.

Dominik Goeke, Timo Gschwind, Michael Schneider

Discret. Appl. Math., 2019

2018

Stabilized branch-and-price algorithms for vector packing problems.

Katrin Heßler, Timo Gschwind, Stefan Irnich

Eur. J. Oper. Res., 2018

Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems.

Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk

Eur. J. Oper. Res., 2018

Maximum weight relaxed cliques and Russian Doll Search revisited.

Timo Gschwind, Stefan Irnich, Isabel Podlinski

Discret. Appl. Math., 2018

2017

Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities.

Timo Gschwind, Stefan Irnich

OR Spectr., 2017

Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster.

Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, Stefan Irnich

Eur. J. Oper. Res., 2017

2016

Dual Inequalities for Stabilized Column Generation Revisited.

Timo Gschwind, Stefan Irnich

INFORMS J. Comput., 2016

2015

Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem.

Timo Gschwind, Stefan Irnich

Transp. Sci., 2015

A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem.

Timo Gschwind

Eur. J. Oper. Res., 2015

2011

A note on symmetry reduction for circular traveling tournament problems.

Timo Gschwind, Stefan Irnich

Eur. J. Oper. Res., 2011