A graph- and monoid-based framework for price-sensitive routing in local public transportation networks (Q6591924)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A graph- and monoid-based framework for price-sensitive routing in local public transportation networks |
scientific article; zbMATH DE number 7900652
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph- and monoid-based framework for price-sensitive routing in local public transportation networks |
scientific article; zbMATH DE number 7900652 |
Statements
A graph- and monoid-based framework for price-sensitive routing in local public transportation networks (English)
0 references
22 August 2024
0 references
shortest path
0 references
public transit
0 references
optimization
0 references
price-sensitive
0 references
raptor
0 references
fare
0 references
operations research
0 references
