
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method
The Quickest Transshipment Problem is to route flow as quickly as possib...
read it

Towards Lower Bounds on the Depth of ReLU Neural Networks
We contribute to a better understanding of the class of functions that i...
read it

A simple proof of the MooreHodgson Algorithm for minimizing the number of late jobs
The MooreHodgson Algorithm minimizes the number of late jobs on a singl...
read it

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...
read it

MultiSource MultiSink Nash Flows Over Time
Nash flows over time describe the behavior of selfish users eager to rea...
read it

Generalizing the KawaguchiKyan bound to stochastic parallel machine scheduling
Minimizing the sum of weighted completion times on m identical parallel ...
read it

On the Complexity of Instationary Gas Flows
We study a simplistic model of instationary gas flows consisting of a se...
read it
Martin Skutella
is this you? claim profile