{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:28:39Z","timestamp":1762864119428},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0377-2217(97)00406-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"517-530","source":"Crossref","is-referenced-by-count":11,"title":["Sensitivity analysis of a railway station track layout with respect to a given timetable"],"prefix":"10.1016","volume":"112","author":[{"given":"Michiel A.","family":"Odijk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0377-2217(97)00406-2_BIB1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1214\/aoap\/1177005980","article-title":"Geometric bounds for eigenvalues of markov chains","volume":"1","author":"Diaconis","year":"1991","journal-title":"The Annals of Applied Probability"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(91)90262-T","article-title":"Periodic transportation schedules with flexible departure times","volume":"50","author":"Gertsbakh","year":"1991","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB3","unstructured":"J.S. Hooghiemstra, Design of regular interval timetables for strategic and tactical railway planning, in: J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, S. Sone (eds.), Computers in Railways, vol. 1, Computational Mechanics Publications, Southampton, 1996, pp. 393\u2013402"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB5","doi-asserted-by":"crossref","unstructured":"R. Kannan, Markov chains and polynomial time algorithms, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 656\u2013671","DOI":"10.1109\/SFCS.1994.365726"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0377-2217(95)00342-8","article-title":"Routing trains through railway stations: Complexity issues","volume":"98","author":"Kroon","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/S0377-2217(97)00406-2_BIB7","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0191-2615(96)00005-7","article-title":"A constraint generation algorithm for the construction of periodic railway timetables","volume":"30","author":"Odijk","year":"1996","journal-title":"Transportation Research B"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB8","unstructured":"M.A. Odijk, Timetable-independent design and analysis of railway infrastructure, in: J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, S. Sone (Eds.), Computers in Railways, vol. 1, Computational Mechanics Publications, Southampton, 1996, pp. 3\u201312"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB9","unstructured":"M.A. Odijk, Railway Timetable Generation, Ph.D. Thesis, Delft University of Technology, Delft, The Netherlands, 1997"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB10","unstructured":"M.A. Odijk, P.J. Zwaneveld, J.S. Hooghiemstra, L.G. Kroon, M. Salomon, Decision support systems help railned to search for Win-Win solutions in railway network design (to appear in Interfaces)"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB11","unstructured":"R.T. Rockafellar, Network Flows and Monotropic Optimization, Wiley, New York, 1984"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB12","unstructured":"C.P. Schnorr, Optimal Algorithms for Self-reducible Problems, Proceedings of the Third International Colloquium on Automata, Languages, and Programming, 1976, pp. 322\u2013337"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB13","unstructured":"A. Schrijver, A. Steenbeek, Dienstregelingontwikkeling voor Railned \u2013 Rapport CADANS 1.0., (in Dutch) Report, Center for Mathematics and Computer Science, Amsterdam, 1994"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB14","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0402049","article-title":"A mathematical model for periodic scheduling problems","volume":"2","author":"Serafini","year":"1989","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB15","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/0377-2217(89)90318-4","article-title":"A mathematical model for the fixed-time traffic control problem","volume":"42","author":"Serafini","year":"1989","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB16","doi-asserted-by":"crossref","unstructured":"A.J. Sinclair, Algorithms for Random Generation And Counting: A Markov Chain Approach, Birkh\u00e4user, Boston, 1992","DOI":"10.1007\/978-1-4612-0323-0"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB17","unstructured":"J.H.A. Van den Berg, M.A. Odijk, DONS: Computer aided design of regular service timetables, in: T.K.S. Murthy, C.A. Brebbia, B. Mellitt, G. Sciutto, S. Sone (Eds.), Computers in Railways vol. IV, no. 2, Computational Mechanics Publications, Southampton, 1994, pp. 109\u2013116"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB18","unstructured":"M. Voorhoeve, Rail scheduling with discrete sets, Working paper (draft), Eindhoven University of Technology, Eindhoven, The Netherlands, 1993"},{"issue":"3","key":"10.1016\/S0377-2217(97)00406-2_BIB19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/trsc.30.3.181","article-title":"Routing trains through railway stations: Model formulation and algorithms","volume":"30","author":"Zwaneveld","year":"1996","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB20","unstructured":"P.J. Zwaneveld, L.G. Kroon, H.W. Ambergen, A decision support system for routing trains through railway station, in: J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, S. Sone (Eds.), Computers in Railways, vol. 2, Computational Mechanics Publications, Southampton, 1996, 217\u2013226"},{"key":"10.1016\/S0377-2217(97)00406-2_BIB21","unstructured":"P.J. Zwaneveld, Railway Planning: Routing Trains and Allocation of Passenger Lines, Ph.D. Thesis, Erasmus University Rotterdam, Rotterdam, and TRAIL, Delft, The Netherlands, 1997"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T18:03:29Z","timestamp":1579025009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797004062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0377221797004062"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00406-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}