The Complexity of Integrating Routing Decisions in Public Transportation Models
From MaRDI portal
Publication:2917296
DOI10.4230/OASIcs.ATMOS.2010.156zbMath1247.90064OpenAlexW1485327908MaRDI QIDQ2917296
Anita Schöbel, Marie E. Schmidt
Publication date: 28 September 2012
Full work available at URL: https://doi.org/10.4230/OASIcs.ATMOS.2010.156
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
An experimental comparison of periodic timetabling models ⋮ Delay resistant line planning with a view towards passenger transfers ⋮ Line planning in public transportation: models and methods ⋮ Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints ⋮ Timetabling with passenger routing
