research
∙
09/12/2022
A Note on the Quickest Minimum Cost Transshipment Problem
Klinz and Woeginger (1995) prove that the minimum cost quickest flow pro...
share
research
∙
08/13/2021
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method
The Quickest Transshipment Problem is to route flow as quickly as possib...
research
∙
05/31/2021
Towards Lower Bounds on the Depth of ReLU Neural Networks
We contribute to a better understanding of the class of functions that i...
research
∙
04/13/2021
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
The Moore-Hodgson Algorithm minimizes the number of late jobs on a singl...
research
∙
05/28/2020
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
In view of the undisputed success of neural networks and due to the rema...
research
∙
07/03/2018
Multi-Source Multi-Sink Nash Flows Over Time
Nash flows over time describe the behavior of selfish users eager to rea...
research
∙
01/03/2018
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
Minimizing the sum of weighted completion times on m identical parallel ...
research
∙
08/29/2017
