Search Results - "Gschwind, Timo"

Branch-and-Price for the Set-Union Bin Packing Problem.

Authors: Wahlen, Julia Gschwind, Timo

Source: INFORMS Journal on Computing. May/Jun2026, Vol. 38 Issue 3, p844-861. 18p.

Branch-price-and-cut for the production routing problem with time windows.

Authors: Fauß, Eric Gschwind, Timo

Source: OR Spectrum. Jun2026, Vol. 48 Issue 2, p627-668. 42p.

Subjects: Vehicle routing problem, Optimization algorithms, Constraint satisfaction, Mathematical optimization, Mathematical models, Inventory control, Economic lot size

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

Authors: Bianchessi, Nicola Gschwind, Timo Irnich, Stefan

Source: INFORMS Journal on Computing. Jan/Feb2024, Vol. 36 Issue 1, p224-244. 21p.

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

Authors: Wahlen, Julia Gschwind, Timo

Source: Transportation Science (INFORMS). May/Jun2023, Vol. 57 Issue 3, p756-777. 22p.

Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems.

Authors: Faldum, Stefan Gschwind, Timo Irnich, Stefan

Source: Networks. Mar2026, Vol. 87 Issue 2, p111-130. 20p.

Subjects: Vehicle routing problem, Mathematical inequalities, Constraint programming, Scheduling, Mathematical optimization, Algorithms

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

Authors: Desaulniers, Guy Gschwind, Timo Irnich, Stefan

Source: Transportation Science (INFORMS). Sep/Oct2020, Vol. 54 Issue 5, p1170-1188. 19p.

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

Authors: Gschwind, Timo Irnich, Stefan Furini, Fabio et al.

Source: INFORMS Journal on Computing. Summer2021, Vol. 33 Issue 3, p1070-1090. 21p.

Exact algorithms for routing electric autonomous mobile robots in intralogistics.

Authors: Meyer, Anne Gschwind, Timo Amberg, Boris et al.

Source: European Journal of Operational Research. Jun2025, Vol. 323 Issue 3, p830-851. 22p.

Subjects: Vehicle routing problem, Autonomous robots, Routing algorithms, Mobile robots, Electric vehicles

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

Authors: Gschwind, Timo Drexl, Michael

Source: Transportation Science (INFORMS). Mar/Apr2019, Vol. 53 Issue 2, p480-491. 12p.

Dual Inequalities for Stabilized Column Generation Revisited.

Authors: Gschwind, Timo Irnich, Stefan

Source: INFORMS Journal on Computing. Winter2016, Vol. 28 Issue 1, p175-194. 20p.

A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems.

Authors: Aerts-Veenstra, Marjolein Cherkesly, Marilène Gschwind, Timo

Source: Transportation Science (INFORMS); Sep/Oct2024, Vol. 58 Issue 5, p1121-1142, 22p

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

Authors: Gschwind, Timo Irnich, Stefan

Source: Transportation Science (INFORMS). May2015, Vol. 49 Issue 2, p335-354. 20p.

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

Authors: Gschwind, Timo Irnich, Stefan Tilk, Christian et al.

Source: Journal of Scheduling; Jun2020, Vol. 23 Issue 3, p363-377, 15p

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

Authors: Gschwind, Timo¹ (AUTHOR) gschwind@uni-mainz.de

Source: OR Spectrum. Jun2019, Vol. 41 Issue 2, p491-512. 22p.

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

Authors: Cherkesly, Marilène Gschwind, Timo

Source: European Journal of Operational Research. Sep2022, Vol. 301 Issue 2, p647-666. 20p.

Subjects: Tracking algorithms, Golgi apparatus, Problem solving, Loading & unloading

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

Authors: Gschwind, Timo Irnich, Stefan

Source: OR Spectrum. Mar2017, Vol. 39 Issue 2, p541-556. 16p.

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

Authors: Becker, Christian Gauthier, Jean Bertrand Gschwind, Timo et al.

Source: Discrete Applied Mathematics; Apr2023, Vol. 329, p61-86, 26p

Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff.

Authors: Faldum, Stefan Machate, Sarah Gschwind, Timo et al.

Source: OR Spectrum. Dec2024, Vol. 46 Issue 4, p1063-1097. 35p.

Manufacturing capacity planning and the value of multi-stage stochastic programming under Markovian demand.

Authors: Stephan, Holger A. Gschwind, Timo Minner, Stefan

Source: Flexible Services & Manufacturing Journal; Dec2010, Vol. 22 Issue 3/4, p143-162, 20p, 1 Diagram, 8 Charts, 1 Graph

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

Authors: Gschwind, Timo Bianchessi, Nicola Irnich, Stefan

Source: European Journal of Operational Research. Oct2019, Vol. 278 Issue 1, p91-104. 14p.

Subjects: Vehicle routing problem, Cutting stock problem