16 citations · 30 across the 17 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Improved Approximation Algorithms for Inventory Problems
Thomas Bosman, Neil Olver
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we ar…
cs.DS2019
Algorithms for flows over time with scheduling costs
Dario Frascaria, Neil Olver
Flows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an associated delay for…