2 citations · 2 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs
David Alemán Espinosa, Niklas Schlomberg
The multicommodity flow problem in an undirected capacitated graph is specified by a set of source-sink pairs with nonnegative demands. A flow is feasible if it routes all dema…
cs.DS2022★ 2 cited
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
Jannis Blauth, Stephan Held, Dirk Müller +4
We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results.…