Ricardo Euler
YOU?
Author Swipe
View article: Logic-Constrained Shortest Paths for Flight Planning
Logic-Constrained Shortest Paths for Flight Planning Open
The logic-constrained shortest path problem (LCSPP) combines a one-to-one shortest path problem with satisfiability constraints imposed on the routing graph. This setting arises in flight planning, where air traffic control (ATC) authoriti…
View article: Price optimal routing in public transportation
Price optimal routing in public transportation Open
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 time in a public transportation network. Public transit fare …
View article: Labeling Methods for Partially Ordered Paths
Labeling Methods for Partially Ordered Paths Open
The landscape of applications and subroutines relying on shortest path computations continues to grow steadily. This growth is driven by the undeniable success of shortest path algorithms in theory and practice. It also introduces new chal…
View article: Price Optimal Routing in Public Transportation
Price Optimal Routing in Public Transportation Open
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 time in a public transportation network. Public transit fare …
View article: A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks
A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks Open
We present a novel framework to mathematically describe the fare systems of local public transit companies. The model allows the computation of a provably cheapest itinerary even if prices depend on a number of parameters and non-linear co…