Using light spanning graphs for passenger assignment in public transport

DOI10.4230/OASICS.ATMOS.2023.2MaRDI QIDQ6591930zbMATH OpenFDO

Authors Irene Heinrich, Olli Herrala, Philine Schiewe, Topias Terho

Publication date 22 August 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2023.2

zbMATH Keywords

algorithm designcomplexitydiscrete optimizationline planningpassenger assignmentpublic transport

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Cost-minimal public transport planning
• Cheapest paths in public transport: properties and algorithms
• Optimal network design for an on-demand transport system
• Car or Public Transport—Two Worlds
• scientific article; zbMATH DE number 5117501

Cited in

(2)

• Simple approximations for general spanner problems
• Exact minimum weight spanners via column generation

This page was built for publication: Using light spanning graphs for passenger assignment in public transport

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591930)