1 citations · 1 across the 1 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024
Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
Berenike Masing, Niels Lindner, Enrico Bortoletto
Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question lea…
math.OC2022
The Price of Symmetric Line Plans in the Parametric City
Berenike Masing, Niels Lindner, Ralf Borndörfer
We consider the line planning problem in public transport in the Parametric City, an idealized model that captures typical scenarios by a (small) number of parameters. The Parametr…