Lehrstuhl für BWL, insbesondere Logistik

Publikationen

Branch-Price-and-Cut-Based Solution of Order Batching Problems
Wahlen, Julia; Gschwind, Timo

Technical Report L-2022-01, Chair of Logistics, Technische Universität Kaiserslautern, 2022.

bibTex  PDF
In-depth analysis of granular local search for capacitated vehicle routing
Schröder, Christian; Schneider, Michael; Gauthier, Jean Bertand; Gschwind, Timo

Working Paper DPO, 02/2020

bibTex  PDF
The Pickup and Delivery Problem with Time Windows, Multiple Stacks, and Handling Operations
Gschwind, Timo; Cherkesly, Marilène

In:  European Journal of Operational Research https://doi.org/10.1016/j.ejor.2021.11.021

bibTex  PDF
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models
Desaulniers, Guy; Gschwind, Timo; Irnich, Stefan (2020)

In: Transportation Science 54 (5), 2020 https://doi.org/10.1287/trsc.2020.0988

bibTex

 

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
Gschwind, Timo; Irnich, Stefan; Furini, Fabio; Calvo, Roberto Wolfler (2020)

In: INFORMS Journal on Computing 54 (5), 2020 https://doi.org/10.1287/ijoc.2020.0984

bibTex  PDF
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
Gschwind, Timo; Irnich, Stefan; Tilk, Christian; Emde, Simon (2020)

In: Journal of Scheduling 23(3), 2020https://doi.org/10.1007/s10951-019-00620-y

bibTex  PDF
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
Goeke, Dominik; Gschwind, Timo; Schneider, Michael (2019)

In: Discrete Applied Mathematics (264), 2019 https://doi.org/10.1016/j.dam.2018.10.015

bibTex  PDF
Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problems
Gschwind, Timo (2019)

In: OR Spectrum 41(2), 2019 https://doi.org/10.1007/s00291-018-0544-0

bibTex  PDF
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
Gschwind, Timo; Bianchessi, Nicola; Irnich, Stefan (2019)

In: European Journal of Operational Research 278 (1), 2019 https://doi.org/10.1016/j.ejor.2019.04.008

bibTex  PDF
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
Gschwind, Timo; Drexl, Michael (2019)

In: Transportation Science 53 (2), 2019 https://doi.org/10.1287/trsc.2018.0837

bibTex  PDF
Solution Tecniques for the Blocking Job Shop Scheduling Problem with Total Tardiness Minimization
Julia Lange (2019)

In: Dissertation, Otto-von-Guericke-Universität Magdeburg, 2019 https://opendata.uni-halle.de/handle/1981185920/14181

bibTex  PDF
On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems
Lange, Julia; Werner, Frank (2019)

In: Algorithms 12 (11), 2019 https://doi.org/10.3390/a12110242

bibTex  PDF
Maximum weight relaxed cliques and Russian Doll Search revisited
Gschwind, Timo; Irnich, Stefan; Podlinski, Isabel (2018)

In: Discrete Applied Mathematics 234, 2018 https://doi.org/10.1016/j.dam.2016.09.039

bibTex  PDF
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
Gschwind, Timo; Irnich, Stefan; Rothenbächer, Ann-Kathrin; Tilk, Christian (2018)

In: European Journal of Operational Research 266 (2), 2018 https://doi.org/10.1016/j.ejor.2017.09.035

bibTex  PDF
Stabilized branch-and-price algorithms for vector packing problems
Heßler, Katrin; Gschwind, Timo; Irnich, Stefan (2018)

In: European Journal of Operational Research 271 (2), 2018 https://doi.org/10.1016/j.ejor.2018.04.047

bibTex  PDF
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
Gschwind, Timo; Irnich, Stefan (2017)

In: OR Spectrum 39 (2), 2017 https://doi.org/10.1007/s00291-016-0463-x

bibTex  PDF
Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques
Gschwind, Timo; Irnich, Stefan; Furini, Fabio; Calvo, Roberto Wolfler (2017)

In: Discussion Paper Series 1520, 2017

bibTex  PDF
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
Tilk, Christian; Rothenbächer, Ann-Kathrin; Gschwind, Timo; Irnich, Stefan (2017)

In: European Journal of Operational Research 261 (2), 2017 https://doi.org/10.1016/j.ejor.2017.03.017

bibTex  PDF
Dual Inequalities for Stabilized Column Generation Revisited
Gschwind, Timo; Irnich, Stefan (2016)

In: INFORMS Journal on Computing 28 (1), 2016 https://doi.org/10.1287/ijoc.2015.0670

bibTex  PDF
Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques
Gschwind, Timo; Irnich, Stefan; Furini, Fabio; Calvo, Roberto Wolfler (2015)

In: Discussion Paper Series 1722, 2015 

bibTex  PDF
A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem
Gschwind, Timo (2015)

In: European Journal of Operational Research 247 (1), 2015 https://doi.org/10.1016/j.ejor.2015.06.017

bibTex  PDF
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem
Gschwind, Timo; Irnich, Stefan (2015)

In: Transportation Science 49 (2), 2015 https://doi.org/10.1287/trsc.2014.0531

bibTex  PDF
A note on symmetry reduction for circular traveling tournament problems
Gschwind, Timo; Irnich, Stefan (2011)

In: European Journal of Operational Research 210 (2), 2011 https://doi.org/10.1016/j.ejor.2010.08.015

bibTex  PDF
Manufacturing capacity planning and the value of multi-stage stochastic programming under Markovian demand
Stephan, Holger A.; Gschwind, Timo; Minner, Stefan (2010)

In: Flex Serv Manuf J (Flexible Services and Manufacturing Journal) 22 (3-4), 2010 https://doi.org/10.1007/s10696-010-9071-2

bibTex  PDF
Zum Seitenanfang