Timo Gschwind

619 total citations
24 papers, 383 citations indexed

About

Timo Gschwind is a scholar working on Industrial and Manufacturing Engineering, Automotive Engineering and Computer Networks and Communications. According to data from OpenAlex, Timo Gschwind has authored 24 papers receiving a total of 383 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Industrial and Manufacturing Engineering, 8 papers in Automotive Engineering and 7 papers in Computer Networks and Communications. Recurrent topics in Timo Gschwind's work include Vehicle Routing Optimization Methods (20 papers), Transportation and Mobility Innovations (8 papers) and Optimization and Search Problems (6 papers). Timo Gschwind is often cited by papers focused on Vehicle Routing Optimization Methods (20 papers), Transportation and Mobility Innovations (8 papers) and Optimization and Search Problems (6 papers). Timo Gschwind collaborates with scholars based in Germany, Italy and Canada. Timo Gschwind's co-authors include Stefan Irnich, Michael Drexl, Nicola Bianchessi, Stefan Minner, Michael Schneider, Dominik Goeke, Simon Emde, Fabio Furini, Anne Meyer and Roberto Wolfler Calvo and has published in prestigious journals such as European Journal of Operational Research, Transportation Science and Discrete Applied Mathematics.

In The Last Decade

Timo Gschwind

22 papers receiving 377 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Timo Gschwind Germany 11 305 181 137 50 35 24 383
Ulrike Ritzinger Austria 6 248 0.8× 215 1.2× 110 0.8× 26 0.5× 81 2.3× 9 359
Rahma Lahyani Saudi Arabia 9 368 1.2× 146 0.8× 190 1.4× 26 0.5× 33 0.9× 13 453
François Vanderbeck France 7 319 1.0× 118 0.7× 75 0.5× 54 1.1× 34 1.0× 9 399
Andrea Bettinelli Italy 10 362 1.2× 123 0.7× 103 0.8× 66 1.3× 54 1.5× 19 463
Enrico Bartolini Italy 12 520 1.7× 321 1.8× 207 1.5× 30 0.6× 87 2.5× 17 615
Jorge Riera‐Ledesma Spain 11 348 1.1× 194 1.1× 119 0.9× 17 0.3× 81 2.3× 16 414
Mads Kehlet Jepsen Denmark 7 451 1.5× 232 1.3× 191 1.4× 29 0.6× 53 1.5× 9 483
Rafael Martinelli Brazil 9 333 1.1× 146 0.8× 116 0.8× 18 0.4× 42 1.2× 21 410
Snežana Mitrović-Minić Canada 8 411 1.3× 327 1.8× 201 1.5× 71 1.4× 106 3.0× 10 527
Xinan Yang United Kingdom 9 180 0.6× 147 0.8× 134 1.0× 30 0.6× 35 1.0× 21 317

Countries citing papers authored by Timo Gschwind

Since Specialization
Citations

This map shows the geographic impact of Timo Gschwind's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Timo Gschwind with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Timo Gschwind more than expected).

Fields of papers citing papers by Timo Gschwind

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Timo Gschwind. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Timo Gschwind. The network helps show where Timo Gschwind may publish in the future.

Co-authorship network of co-authors of Timo Gschwind

This figure shows the co-authorship network connecting the top 25 collaborators of Timo Gschwind. A scholar is included among the top collaborators of Timo Gschwind based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Timo Gschwind. Timo Gschwind is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Meyer, Anne, et al.. (2024). Exact algorithms for routing electric autonomous mobile robots in intralogistics. European Journal of Operational Research. 323(3). 830–851. 2 indexed citations
2.
Gschwind, Timo, et al.. (2024). A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems. Transportation Science. 58(5). 1121–1142. 2 indexed citations
3.
Gschwind, Timo, et al.. (2023). In-depth analysis of granular local search for capacitated vehicle routing. Discrete Applied Mathematics. 329. 61–86. 1 indexed citations
4.
Bianchessi, Nicola, Timo Gschwind, & Stefan Irnich. (2023). Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS journal on computing. 36(1). 224–244.
5.
Gschwind, Timo, et al.. (2023). Branch-Price-and-Cut-Based Solution of Order Batching Problems. Transportation Science. 57(3). 756–777. 8 indexed citations
6.
Gschwind, Timo, Stefan Irnich, Fabio Furini, & Roberto Wolfler Calvo. (2020). A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS journal on computing. 33(3). 1070–1090. 5 indexed citations
7.
Desaulniers, Guy, Timo Gschwind, & Stefan Irnich. (2020). Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models. Transportation Science. 54(5). 1170–1188. 1 indexed citations
8.
Gschwind, Timo, Nicola Bianchessi, & Stefan Irnich. (2019). Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. European Journal of Operational Research. 278(1). 91–104. 27 indexed citations
9.
Gschwind, Timo, et al.. (2019). Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. Journal of Scheduling. 23(3). 363–377. 8 indexed citations
10.
Gschwind, Timo & Michael Drexl. (2019). Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem. Transportation Science. 53(2). 480–491. 66 indexed citations
11.
Goeke, Dominik, Timo Gschwind, & Michael Schneider. (2018). Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier. Discrete Applied Mathematics. 264. 43–61. 15 indexed citations
12.
Schneider, Michael, Timo Gschwind, & Daniele Vigo. (2018). Advances in vehicle routing and logistics optimization: exact methods. EURO Journal on Transportation and Logistics. 8(2). 117–118.
13.
Gschwind, Timo, et al.. (2018). Stabilized branch-and-price algorithms for vector packing problems. European Journal of Operational Research. 271(2). 401–419. 12 indexed citations
14.
Gschwind, Timo. (2018). Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem. OR Spectrum. 41(2). 491–512. 2 indexed citations
15.
Gschwind, Timo, et al.. (2016). Maximum weight relaxed cliques and Russian Doll Search revisited. Discrete Applied Mathematics. 234. 131–138. 18 indexed citations
16.
Gschwind, Timo & Stefan Irnich. (2016). Dual Inequalities for Stabilized Column Generation Revisited. INFORMS journal on computing. 28(1). 175–194. 26 indexed citations
17.
Gschwind, Timo & Stefan Irnich. (2016). Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities. OR Spectrum. 39(2). 541–556. 10 indexed citations
18.
Gschwind, Timo. (2015). A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem. European Journal of Operational Research. 247(1). 60–71. 14 indexed citations
19.
Gschwind, Timo & Stefan Irnich. (2014). Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem. Transportation Science. 49(2). 335–354. 55 indexed citations
20.
Gschwind, Timo, et al.. (2010). Manufacturing capacity planning and the value of multi-stage stochastic programming under Markovian demand. Flexible Services and Manufacturing Journal. 22(3-4). 143–162. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Ulrike Ritzinger Breakdown of academic impact, for papers by Rahma Lahyani Breakdown of academic impact, for papers by François Vanderbeck Breakdown of academic impact, for papers by Andrea Bettinelli Breakdown of academic impact, for papers by Enrico Bartolini Breakdown of academic impact, for papers by Jorge Riera‐Ledesma Breakdown of academic impact, for papers by Mads Kehlet Jepsen Breakdown of academic impact, for papers by Rafael Martinelli Breakdown of academic impact, for papers by Snežana Mitrović-Minić Breakdown of academic impact, for papers by Xinan Yang
Rankless by CCL
2026