Locating New Stops in a Railway Network1 1This work was partially supported by the Human Potential Programme of the European Union under contract no. HPRN-CT-1999-00104 (AMORE).
Open Access
- 1 August 2001
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 50 (1) , 13-23
- https://doi.org/10.1016/s1571-0661(04)00162-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972