A graph theoretical approach to the shunting problem

Electronic Notes in Theoretical Computer Science

Volumn 92, Issue , 2004, Pages 16-33

  Di Stefano, Gabriele ^a   Koči, Magnus Love ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

3 uniform hypergraphs; Permutation graphs; Shunting problem; Unimodal sequences

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; QUALITY OF SERVICE; RAILROAD TRACKS; TRAIN FERRIES;

3-UNIFORM HYPERGRAPHS; PERMUTATION GRAPHS; SHUNTING PROBLEM; UNIMODAL SEQUENCES;

GRAPH THEORY;

EID: 18944371990     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2003.12.020     Document Type: Conference Paper

References (14)

1. Blasum U., Bussieck M.R., Hochstättler W., Moll C., Scheel H., Winter T. Scheduling trams in the morning. Mathematical Methods of Operations Research. 49:(1):2000;137-148
2. Brandstädt A. On improved time bounds for permutation graph problems. Lecture Notes in Computer Science. 657:1993;1-10
3. Brandstädt A., Le V.B., Spinrad J.P. Graph classes: a survey. 1999;SIAM
4. Gallo G., Di Miele F. Dispatching buses in parking depots. Transportation Science. 35:(3):2001;322-330
5. Gavril F. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks. 3:1973;261-273
6. Garey M.R., Johnson D.S. Computers and intractability. 1979;Freeman
7. Golumbic M.C. Algorithmic graph theory and perfect graphs. 1980;Academic press
8. He S., Song R., Chaudhry S.S. Fuzzy dispatching model and genetic algorithms for railyards operations. European Journal of Operations Research. 124:2000;307-331
9. Dahlhaus E., Horak P., Miller M., Ryan J.F. The train marshalling problem. Discrete Applied Mathematics. 103:(1-3):2000;41-54
10. R. Freling, R.M. Lentink, L.G. Kroon, D. Huisman, Shunting of Passenger Train Units in a Railway Station. Ecomometric Institute Report 277, Erasmus University Rotterdam, Econometric Institute, 2002
11. Lovász L. Coverings and colorings of hypergraphs. Proc. 4-th S.E. Conf. on Combinatorics, Graph Theory and Computing. 1973;3-12
12. Krivelevich M., Sudakov B. Approximate coloring of uniform hypergraphs. Proc. ESA: Annual European Symposium on Algorithms. LNCS. 1461:1998;477-489
13. Unger W. On the k-coloring of Circle Graphs. Lecture Notes in Computer Science. 294:1988;61-72
14. Winter T., Zimmermann U.T. Real-time dispatch of trams in storage yards. Annals of Operations Research. 96:2000;287-315