Personal information

Activities

Employment (2)

RPTU Kaiserslautern-Landau: Kaiserslautern, DE

2019-04 to present
Employment
Source: Self-asserted source
Timo Gschwind

Johannes Gutenberg University Mainz: Mainz, DE

2009-09-01 to 2019-03
Employment
Source: Self-asserted source
Timo Gschwind

Works (25)

Exact algorithms for routing electric autonomous mobile robots in intralogistics

European Journal of Operational Research
2024-12 | Journal article
Contributors: Anne Meyer; Timo Gschwind; Boris Amberg; Dominik Colling
Source: check_circle
Crossref

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

OR Spectrum
2024-12 | Journal article
Contributors: Stefan Faldum; Sarah Machate; Timo Gschwind; Stefan Irnich
Source: check_circle
Crossref

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

Transportation Science
2024-09 | Journal article
Contributors: Marjolein Aerts-Veenstra; Marilène Cherkesly; Timo Gschwind
Source: check_circle
Crossref

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

INFORMS Journal on Computing
2024-01 | Journal article
Contributors: Nicola Bianchessi; Timo Gschwind; Stefan Irnich
Source: check_circle
Crossref

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

Discrete Applied Mathematics
2023 | Journal article
EID:

2-s2.0-85145782223

Part of ISSN: 0166218X
Contributors: Becker, C.; Gauthier, J.B.; Gschwind, T.; Schneider, M.
Source: Self-asserted source
Timo Gschwind via Scopus - Elsevier

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

Transportation Science
2023-05 | Journal article
Contributors: Julia Wahlen; Timo Gschwind
Source: check_circle
Crossref

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

European Journal of Operational Research
2022 | Journal article
EID:

2-s2.0-85120819230

Part of ISSN: 03772217
Contributors: Cherkesly, M.; Gschwind, T.
Source: Self-asserted source
Timo Gschwind via Scopus - Elsevier

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

INFORMS Journal on Computing
2021-07 | Journal article
Contributors: Timo Gschwind; Stefan Irnich; Fabio Furini; Roberto Wolfler Calvo
Source: check_circle
Crossref

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

Transportation Science
2020-09 | Journal article
Contributors: Guy Desaulniers; Timo Gschwind; Stefan Irnich
Source: check_circle
Crossref

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

Journal of Scheduling
2020-06-06 | Journal article
Contributors: Timo Gschwind; Stefan Irnich; Christian Tilk; Simon Emde
Source: check_circle
Crossref

Advances in vehicle routing and logistics optimization: exact methods

EURO Journal on Transportation and Logistics
2019 | Journal article
EID:

2-s2.0-85081388003

Part of ISSN: 21924384 21924376
Contributors: Schneider, M.; Gschwind, T.; Vigo, D.
Source: Self-asserted source
Timo Gschwind via Scopus - Elsevier

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

European Journal of Operational Research
2019-10 | Journal article
Contributors: Timo Gschwind; Nicola Bianchessi; Stefan Irnich
Source: check_circle
Crossref

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

Discrete Applied Mathematics
2019-07 | Journal article
Contributors: Dominik Goeke; Timo Gschwind; Michael Schneider
Source: check_circle
Crossref

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

OR Spectrum
2019-06-17 | Journal article
Contributors: Timo Gschwind
Source: check_circle
Crossref

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

Transportation Science
2019-03 | Journal article
Contributors: Timo Gschwind; Michael Drexl
Source: check_circle
Crossref

Stabilized branch-and-price algorithms for vector packing problems

European Journal of Operational Research
2018-05 | Journal article
Part of ISSN: 0377-2217
Contributors: Katrin Heßler; Timo Gschwind; Stefan Irnich
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

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

European Journal of Operational Research
2018-04 | Journal article
Part of ISSN: 0377-2217
Contributors: Timo Gschwind; Stefan Irnich; Ann-Kathrin Rothenbächer; Christian Tilk
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

Maximum weight relaxed cliques and Russian Doll Search revisited

Discrete Applied Mathematics
2018-01 | Journal article
Part of ISSN: 0166-218X
Contributors: Timo Gschwind; Stefan Irnich; Isabel Podlinski
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

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

European Journal of Operational Research
2017-09 | Journal article
Part of ISSN: 0377-2217
Contributors: Christian Tilk; Ann-Kathrin Rothenbächer; Timo Gschwind; Stefan Irnich
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

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

OR Spectrum
2016-10 | Journal article
Part of ISSN: 0171-6468
Contributors: Timo Gschwind; Stefan Irnich
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

Dual Inequalities for Stabilized Column Generation Revisited

INFORMS Journal on Computing
2016-02 | Journal article
Part of ISSN: 1091-9856
Contributors: Timo Gschwind; Stefan Irnich
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

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

European Journal of Operational Research
2015-11 | Journal article
Part of ISSN: 0377-2217
Contributors: Timo Gschwind
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

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

Transportation Science
2015-05 | Journal article
Part of ISSN: 0041-1655
Contributors: Timo Gschwind; Stefan Irnich
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

A note on symmetry reduction for circular traveling tournament problems

European Journal of Operational Research
2011-04 | Journal article
Part of ISSN: 0377-2217
Contributors: Timo Gschwind; Stefan Irnich
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

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

Flexible Services and Manufacturing Journal
2010 | Journal article
Part of ISSN: 1936-6582
Contributors: Holger A. Stephan; Timo Gschwind; Stefan Minner
Source: Self-asserted source
Timo Gschwind via Crossref Metadata Search

Peer review (2 reviews for 2 publications/grants)

Review activity for European journal of operational research. (1)
Review activity for OR-Spektrum. (1)