Folgen
Timo Gschwind
Timo Gschwind
RPTU Kaiserslautern-Landau
Bestätigte E-Mail-Adresse bei rptu.de
Titel
Zitiert von
Zitiert von
Jahr
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
1332019
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
1052015
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
932017
Dual inequalities for stabilized column generation revisited
T Gschwind, S Irnich
INFORMS Journal on Computing 28 (1), 175-194, 2016
592016
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
542018
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, 143-162, 2010
402010
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
372019
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
342018
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
302015
Maximum weight relaxed cliques and Russian Doll Search revisited
T Gschwind, S Irnich, I Podlinski
Discrete Applied Mathematics 234, 131-138, 2018
272018
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
252020
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
232019
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
T Gschwind, S Irnich
OR spectrum 39, 541-556, 2017
212017
The pickup and delivery problem with time windows, multiple stacks, and handling operations
M Cherkesly, T Gschwind
European Journal of Operational Research 301 (2), 647-666, 2022
172022
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
152015
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
T Gschwind, S Irnich, C Tilk, S Emde
Journal of Scheduling 23 (3), 363-377, 2020
132020
A branch-and-price framework for decomposing graphs into relaxed cliques
T Gschwind, S Irnich, F Furini, RW Calvo
INFORMS Journal on Computing 33 (3), 1070-1090, 2021
122021
Branch-price-and-cut-based solution of order batching problems
J Wahlen, T Gschwind
Transportation Science 57 (3), 756-777, 2023
102023
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
102012
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
82015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20