We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the general version, some interesting cases can be solved exactly by a suitable dynamic programming approach. For variants in which we also take into account existing connections between cities and railway tracks (streets, buses, etc.) we instead show some hardness results. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Kranakis, E., Penna, P., Schlude, K., Taylor, D. S., & Widmayer, P. (2003). Improving customer proximity to railway stations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2653, 264–276. https://doi.org/10.1007/3-540-44849-7_30
Mendeley helps you to discover research relevant for your work.