|
1 |
On the robustness of potential-based flow networks
Klimm, Max. - Berlin : Technische Universität Berlin, 2023
|
|
|
|
2 |
Packing under convex quadratic constraints
Klimm, Max. - Berlin : Technische Universität Berlin, 2023
|
|
|
|
3 |
Facets of neural network complexity
Hertrich, Christoph. - Berlin : Technische Universität Berlin, 2022
|
|
|
|
4 |
Optimization, reduction, and robustness of potential-based flow networks
Raber, Rico Konrad Béla. - Berlin : Technische Universität Berlin, 2022
|
|
|
5 |
On the robustness of potential-based flow networks
Enthalten in Mathematical programming 9.2.2022: 1-38
|
|
|
|
6 |
Packing under convex quadratic constraints
Enthalten in Mathematical programming 2.7.2021: 1-26
|
|
|
|
7 |
A PTAS for minimizing the total weighted completion time on identical parallel machines
Enthalten in Preprint Reihe Mathematik 1999, 628
|
|
|
|
8 |
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
Enthalten in Preprint Reihe Mathematik 1996, 514
|
|
|
|
9 |
Approximation and complexity of k-splittable flows
Enthalten in Preprint Reihe Mathematik 2004, 19
|
|
|
|
10 |
Computing Minimum Cuts by Randomized Search Heuristics
Enthalten in Preprint Reihe Mathematik 2008, 03
|
|
Administration
