11 citations · 22 across the 8 of their papers we have counts for
10 papers
A Comparison of Models for Rolling Stock Scheduling
Boris Grimm, Rowan Hoogervorst, Ralf Borndörfer
A major step in the planning process of passenger railway operators is the assignment of rolling stock, i.e., train units, to the trips of the timetable. A wide variety of mathemat…
K-Shortest Simple Paths Using Biobjective Path Search
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer +1
In this paper we introduce a new algorithm for the \emph{-Shortest Simple Paths} (\kspp{k}) problem with an asymptotic running time matching the state of the art from the litera…
Convergence Properties of Newton's Method for Globally Optimal Free Flight Trajectory Optimization
Ralf Borndörfer, Fabian Danecker, Martin Weiser
The algorithmic efficiency of Newton-based methods for Free Flight Trajectory Optimization is heavily influenced by the size of the domain of convergence. We provide numerical evid…
New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer
The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant of the Minimum Spanning Tree problem, in which the costs associated with every edge of the input graph are ve…
Newton's Method for Global Free Flight Trajectory Optimization
Ralf Borndörfer, Fabian Danecker, Martin Weiser
Globally optimal free flight trajectory optimization can be achieved with a combination of discrete and continuous optimization. A key requirement is that Newton's method for conti…
Error Bounds for Discrete-Continuous Shortest Path Problems with Application to Free Flight Trajectory Optimization
Ralf Borndörfer, Fabian Danecker, Martin Weiser
Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to g…
Price Optimal Routing in Public Transportation
Ricardo Euler, Niels Lindner, Ralf Borndörfer
We consider the price-optimal earliest arrival problem in public transit (POEAP) in which we aim to calculate the Pareto-set of journeys with respect to ticket price and arrival ti…
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…
Targeted Multiobjective Dijkstra Algorithm
Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda +1
In this paper, we introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for the One-to-One Multiobjective Shortest Path (MOSP) Problem. The T-…
Connected -partition of -connected graphs and -claw-free graphs
Ralf Borndörfer, Katrin Casel, Davis Issac +3
A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road ne…