Timo Gschwind

Orcid: 0000-0002-7715-4994

According to our database1, Timo Gschwind authored at least 23 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems.
Transp. Sci., 2024

Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems.
INFORMS J. Comput., 2024

2023
Branch-Price-and-Cut-Based Solution of Order Batching Problems.
Transp. Sci., May, 2023

In-depth analysis of granular local search for capacitated vehicle routing.
Discret. Appl. Math., April, 2023

2022
The pickup and delivery problem with time windows, multiple stacks, and handling operations.
Eur. J. Oper. Res., 2022

2021
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.
INFORMS J. Comput., 2021

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

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

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

Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem.
OR Spectr., 2019

Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem.
Eur. J. Oper. Res., 2019

Advances in vehicle routing and logistics optimization: exact methods.
EURO J. Transp. Logist., 2019

Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier.
Discret. Appl. Math., 2019

2018
Stabilized branch-and-price algorithms for vector packing problems.
Eur. J. Oper. Res., 2018

Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems.
Eur. J. Oper. Res., 2018

Maximum weight relaxed cliques and Russian Doll Search revisited.
Discret. Appl. Math., 2018

2017
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities.
OR Spectr., 2017

Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster.
Eur. J. Oper. Res., 2017

2016
Dual Inequalities for Stabilized Column Generation Revisited.
INFORMS J. Comput., 2016

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

A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem.
Eur. J. Oper. Res., 2015

2011
A note on symmetry reduction for circular traveling tournament problems.
Eur. J. Oper. Res., 2011


  Loading...