activity
20142026
most citedPrice Optimal Routing in Public Transportation

3 citations · 5 across the 9 of their papers we have counts for

collaborators

12 papers

math.OC2026

Characterizations and Complexity of Minimum Forward and Integer Cycle Bases

Gabor Riccardi, Niels Lindner

The cycle space of a directed graph is generated by a cycle basis, where, in general, cycles are allowed to have both forward and backward arcs. In a forward cycle, all arcs must f…

math.OC2026

Optimizing Travel Time and Regenerative Energy for Periodic Timetables

Sarah Roth, Sven Jäger, Niels Lindner +1

Regenerating braking energy is one major pathway to make rail traffic energy-efficient. It is therefore desirable to design timetables that exploit this feature. However, timetable…

math.OC2026

Computational acceleration strategies for large-scale energy system optimization: a comparative study of GPU-accelerated and distributed-memory solvers

Janina Zittel, Annika Buchholz, Michael Bussieck +5

Energy system optimization models are increasing in scope and resolution, yielding large and challenging linear programs. For a long time, the standard way to address such problems…

math.OC2025

Column Generation for Periodic Timetabling

Stephanie Riedmüller, Niels Lindner

Periodic timetabling for public transportation networks is typically modelled as a Periodic Event Scheduling Problem (PESP). Solving instances of the benchmark library PESPlib to o…

math.OC2025

Integrated Wind Farm Design: Optimizing Turbine Placement and Cable Routing with Wake Effects

Jaap Pedersen, Niels Lindner, Daniel Rehfeldt +1

An accelerated deployment of renewable energy sources is crucial for a successful transformation of the current energy system, with wind energy playing a key role in this transitio…

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.OC2023★ 1 cited

On the Split Closure of the Periodic Timetabling Polytope

Niels Lindner, Berenike Masing

The Periodic Event Scheduling Problem (PESP) is the central mathematical tool for periodic timetable optimization in public transport. PESP can be formulated in several ways as a m…

math.CO2022★ 1 cited

The tropical and zonotopal geometry of periodic timetables

Enrico Bortoletto, Niels Lindner, Berenike Masing

The Periodic Event Scheduling Problem (PESP) is the standard mathematical tool for optimizing periodic timetabling problems in public transport. A solution to PESP consists of thre…

math.OC2022★ 3 cited

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…

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…

math.AG2016

Hypersurfaces with defect

Niels Lindner

A projective hypersurface has defect if for some in a suitable cohomology theory. This occurs fo…

math.AG2014

Density of quasismooth hypersurfaces in simplicial toric varieties

Niels Lindner

This paper investigates the density of hypersurfaces in a projective normal simplicial toric variety over a finite field having a quasismooth intersection with a given quasismooth…