13 citations · 26 across the 17 of their papers we have counts for
22 papers
A Note on the Quickest Minimum Cost Transshipment Problem
Martin Skutella
Klinz and Woeginger (1995) prove that the minimum cost quickest flow problem is NP-hard. On the other hand, the quickest minimum cost flow problem can be solved efficiently via a s…
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…
Towards Lower Bounds on the Depth of ReLU Neural Networks
Christoph Hertrich, Amitabh Basu, Marco Di Summa +1
We contribute to a better understanding of the class of functions that can be represented by a neural network with ReLU activations and a given architecture. Using techniques from…
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…
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
Christoph Hertrich, Martin Skutella
The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence. Against this backgrou…
Packing under Convex Quadratic Constraints
Max Klimm, Marc E. Pfetsch, Rico Raber +1
We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-fa…