Locating new stops in a railway network

Electronic Notes in Theoretical Computer Science

Volumn 50, Issue 1, 2001, Pages 13-23

  Hamacher, Horst W ^a   Liebers, Annegret ^b   Schöbel, Anita ^a   Wagner, Dorothea ^b   Wagner, Frank ^c  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

^c DEUTSCHE BAHN AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CUSTOMER SATISFACTION; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RAILROAD TRANSPORTATION; SET THEORY;

ACCESSIBILITY MODEL; OPTIMIZATION PROBLEMS; RAILWAY INFRASTRUCTURES; RAILWAY NETWORKS;

RAILROADS;

EID: 18844419050     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00162-8     Document Type: Conference Paper

References (5)

1. Drezner Z., Hamacher H. "Location Theory: Applications and Theory" 2001;Springer
2. Elzinga J., Hearn D. Geometrical solutions for some minimax location problems. Transportation Science. 6:1972;379-394
3. Johnson D.S. The NP-Completeness Column: An Ongoing Guide. J. Algorithms. 3:1982;182-195
4. 3 and related problems. SIAM J. on Computing. 12:1983;759-776
5. Reeves C.R. Genetic Algorithms. Reeves C.R. Modern Heuristic Techniques for Combinatorial Problems. 1995;151-196 McGraw Hill