Martin Skutella
Technische Universität Berlin
H-index: 47
Europe-Germany
Top articles of Martin Skutella
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Total Completion Time Scheduling Under Scenarios | Thomas Bosman Martijn van Ee Ekin Ergen Csanád Imreh Alberto Marchetti-Spaccamela | 2023/9/7 | |
Provably good solutions to the knapsack problem via neural networks of bounded size | INFORMS journal on computing | Christoph Hertrich Martin Skutella | 2023/9 |
Towards lower bounds on the depth of relu neural networks | SIAM Journal on Discrete Mathematics | Christoph Hertrich Amitabh Basu Marco Di Summa Martin Skutella | 2023/6/30 |
A note on the quickest minimum cost transshipment problem | Operations Research Letters | Martin Skutella | 2023/5/1 |
An Introduction to Transshipments Over Time | arXiv preprint arXiv:2312.04991 | Martin Skutella | 2023/12/8 |
On the robustness of potential-based flow networks | Mathematical Programming | Max Klimm Marc E Pfetsch Rico Raber Martin Skutella | 2023/1 |
Reduction of potential-based flow networks | Mathematics of Operations Research | Max Klimm Marc E Pfetsch Rico Raber Martin Skutella | 2023/11 |
Single source unsplittable flows with arc-wise lower and upper bounds | Mathematical Programming | Sarah Morell Martin Skutella | 2021/9/1 |
Packing under convex quadratic constraints | Mathematical Programming | Max Klimm Marc E Pfetsch Rico Raber Martin Skutella | 2022/3 |
Competitive Strategies for Symmetric Rendezvous on the Line∗ | Max Klimm Guillaume Sagnol Martin Skutella Khai Van Tran | 2022 | |
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method∗ | Miriam Schlöter Martin Skutella Khai Van Tran | 2022 | |
Approximation of Binary Second Order Cone Programs of Packing Type | Max Klimm Marc Pfetsch Rico Raber Martin Skutella | 2021 | |
Flows over time as continuous limits of packet-based network simulations | Transportation Research Procedia | Theresa Ziemke Leon Sering Laura Vargas Koch Max Zimmer Kai Nagel | 2021/1/1 |
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs | Operations Research Letters | Joseph Cheriyan R Ravi Martin Skutella | 2021/11/1 |
Robust conic optimization in Python | Maximilian Stahlberg Guillaume Sagnol Martin Skutella Manfred Opper | 2020/12 | |
On the complexity of conditional DAG scheduling in multiprocessor systems | Alberto Marchetti-Spaccamela Nicole Megow Jens Schlöter Martin Skutella Leen Stougie | 2020/5/18 | |
Competitive variants of discrete and continuous flows over time | Laura Vargas Koch Eberhard Triesch Martin Skutella Britta Peis | 2020 |
Co-Authors
