1 citations · 1 across the 6 of their papers we have counts for
7 papers · 1 filter
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…
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…
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…
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…
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…
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…