
Nils Mosis
Arbeitsgebiet(e)
Kontakt
mosis@mathematik.tu-...
work +49 6151 16-24385
Work
S4|10 228
Dolivostraße 15
64293
Darmstadt
Publikationen
An unconditional lower bound for the active-set method in convex quadratic maximization
with E. Bach, Y. Disser, S. Huiberts.
An unconditional lower bound for the active-set method on the hypercube
with Y. Disser. IPCO 2025. (arXiv ) full version
A unified worst case for classical simplex and policy iteration pivot rules
with Y. Disser. ISAAC 2023. (arXiv ) full version
An Improved Algorithm for Open Online Dial-a-Ride
with J. Baligács, Y. Disser, D. Weckbecker. WAOA 2022.
---
Lower Bounds for Simplex Pivot Rules via Markov Decision Processes
Operations Research Proceedings 2023.
Laufzeitschranken für den Simplex Algorithmus durch Markov-Entscheidungsprozesse
in . December 2023. OR News Nr. 79
Vorträge
The Simplex Method: Theory, Complexity, and Applications
at FU Berlin. June 2025.
MOR Research Seminar
at University of Twente. January 2025.
Discrete Geometry and Topological Combinatorics Seminar
at FU Berlin. January 2024.
ISAAC 2023
in Kyoto (Japan). December 2023.
( OR 2023) master thesis award
in Hamburg (Germany). August 2023
Seminar of the Research Group Optimization
at TU Darmstadt. November 2023, February 2025.