13 citations · 26 across the 17 of their papers we have counts for
7 papers · 1 filter
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method
Miriam Schlöter, Martin Skutella, Khai Van Tran
The Quickest Transshipment Problem is to route flow as quickly as possible from sources with supplies to sinks with demands in a network with capacities and transit times on the ar…
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
Joseph Cheriyan, R. Ravi, Martin Skutella
The Moore-Hodgson Algorithm minimizes the number of late jobs on a single machine. That is, it finds an optimal schedule for the classical problem . Several proof…
A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Frank Neumann, Sergey Polyakovskiy, Martin Skutella +2
Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP),…
Graph Orientation and Flows Over Time
Ashwin Arulselvan, Martin Groß, Martin Skutella
Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems -- streets, tracks, etc. -- are inherently undirected and dir…
A tight bound on the speed-up through storage for quickest multi-commodity flows
Martin Groß, Martin Skutella
Multi-commodity flows over time exhibit the non-intuitive property that letting flow wait can allow us to send flow faster overall. Fleischer and Skutella (IPCO~2002) show that the…
A note on the generalized min-sum set cover problem
Martin Skutella, David P. Williamson
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin. Bansal, Gupta, and Krishnaswamy give a 485-approximation algorithm for the…