2 papers
math.OC2024
A robust optimization approach to flow decomposition
Moritz Stinzendörfer, Philine Schiewe, Fabricio Oliveira
In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the…
cs.DS2022
Knapsack Secretary Through Boosting
Andreas Abels, Leon Ladewig, Kevin Schewior +1
We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007), a generalization of the classic secretary problem in which items have different sizes and multiple items m…