Timo Gschwind
Timo Gschwind
JGU Mainz, TU Kaiserslautern
Verified email at uni-mainz.de
Title
Cited by
Cited by
Year
Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem
T Gschwind, M Drexl
Transportation Science 53 (2), 480-491, 2019
362019
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
C Tilk, AK Rothenbächer, T Gschwind, S Irnich
European Journal of Operational Research 261 (2), 530-539, 2017
362017
Effective handling of dynamic time windows and its application to solving the dial-a-ride problem
T Gschwind, S Irnich
Transportation Science 49 (2), 335-354, 2015
352015
Dual inequalities for stabilized column generation revisited
T Gschwind, S Irnich
INFORMS Journal on Computing 28 (1), 175-194, 2016
332016
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
T Gschwind, S Irnich, AK Rothenbächer, C Tilk
European Journal of Operational Research 266 (2), 521-530, 2018
242018
Manufacturing capacity planning and the value of multi-stage stochastic programming under Markovian demand
HA Stephan, T Gschwind, S Minner
Flexible services and manufacturing journal 22 (3), 143-162, 2010
242010
A comparison of column-generation approaches to the synchronized pickup and delivery problem
T Gschwind
European Journal of Operational Research 247 (1), 60-71, 2015
182015
Stabilized branch-and-price algorithms for vector packing problems
K Heßler, T Gschwind, S Irnich
European Journal of Operational Research 271 (2), 401-419, 2018
142018
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
T Gschwind, N Bianchessi, S Irnich
European Journal of Operational Research 278 (1), 91-104, 2019
92019
Effective handling of dynamic time windows and synchronization with precedences for exact vehicle routing
T Gschwind, S Irnich, D Mainz
Gutenberg School of Management and Economics, Johannes Gutenberg-Universität …, 2012
92012
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
D Goeke, T Gschwind, M Schneider
Discrete Applied Mathematics 264, 43-61, 2019
82019
Maximum weight relaxed cliques and Russian doll search revisited
T Gschwind, S Irnich, I Podlinski
Discrete Applied Mathematics 234, 131-138, 2018
82018
Social network analysis and community detection by decomposing a graph into relaxed cliques
T Gschwind, S Irnich, F Furini, RW Calvo
Gutenberg School of Management and Economics, Johannes Gutenberg-Universität …, 2015
72015
Route feasibility testing and forward time slack for the synchronized pickup and delivery problem
T Gschwind
Gutenberg School of Management and Economics, Johannes Gutenberg-Universität …, 2015
72015
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
T Gschwind, S Irnich
OR spectrum 39 (2), 541-556, 2017
52017
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
G Desaulniers, T Gschwind, S Irnich
Transportation Science 54 (5), 1170-1188, 2020
42020
A note on symmetry reduction for circular traveling tournament problems
T Gschwind, S Irnich
European Journal of Operational Research 210 (2), 452-456, 2011
42011
Asymmetry helps: Dynamic half-way points for solving shortest path problems with resource constraints faster
C Tilk, AK Rothenbächer, T Gschwind, S Irnich
Gutenberg School of Management and Economics, Johannes Gutenberg-Universität …, 2016
32016
A branch-and-price framework for decomposing graphs into relaxed cliques
T Gschwind, S Irnich, F Furini, RW Calvo
INFORMS Journal on Computing, 2020
12020
In-depth analysis of granular local search for capacitated vehicle routing
C Schröder, JB Gauthier, T Gschwind, M Schneider
Working Paper DPO-2020-03, Deutsche Post Chair–Optimization of Distribution …, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20