{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T03:48:37Z","timestamp":1780112917455,"version":"3.54.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4859,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)00164-1","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T05:14:39Z","timestamp":1075353279000},"page":"39-53","source":"Crossref","is-referenced-by-count":23,"title":["Heuristics for railway infrastructure saturation"],"prefix":"10.1016","volume":"50","author":[{"given":"Xavier","family":"Delorme","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joaquin","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xavier","family":"Gandibleux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB1","unstructured":"Using the cplex callable library (manuel), version 4.0, cplex optimization, 1995."},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB2","unstructured":"Delorme X., \u201cOptimisation combinatoire et probl\u00e8mes de capacit\u00e9 d'infrastructure ferroviaire,\u201d M\u00e9moire de DEA, Universit\u00e9 de Valenciennes et du Hainaut Cambr\u00e9sis, Valenciennes, France (2000)."},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB3","unstructured":"Delorme X., X. Gandibleux and J. Rodriguez, Grasp for set packing problems, Technical Report RT-01-704-FR, INRETS, France (2001)."},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"F\u00e9o","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB5","series-title":"Essays and surveys on metaheuristics","article-title":"Grasp: an annoted bibliography","author":"Festa","year":"2001"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB6","unstructured":"Gaschnig J., A general backtracking algorithm that eliminates most redundant tests, in: International Joint Conference on Artificial Intelligence, Cambridge MA, 1977, pp. 457\u2013466."},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB7","unstructured":"Hachemane P., \u201c\u00c9valuation de la capacit\u00e9 de r\u00e9seaux ferroviaires,\u201d Th\u00e8se 1632, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (1997)."},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Le Pape C., Three mechanisms for managing resource constraints in a library for constraint based scheduling, in: INRIA\/IEEE Conference on Emerging Technologies and Factory Automation, Paris-France, 1995.","DOI":"10.1109\/ETFA.1995.496781"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3845\/ree.1997.088","article-title":"Simulation de syst\u00e8mes ferroviaires - un projet d\u00e9cisif","volume":"7","author":"Moulin","year":"1997","journal-title":"Revue d'\u00c9lectricit\u00e9 et d'\u00c9lectronique"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB11","series-title":"\u201cInteger and combinatorial optimization,\u201d","first-page":"763","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB12","series-title":"Handbook of Applied Optimization","article-title":"Greedy randomized adaptive search procedures","author":"Pitsoulis","year":"2001"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB13","unstructured":"Rodriguez J., Fluidification de noeuds ferroviaires (projet GRRT prospectif), Technical Report RR-00-724-FR, INRETS, France (2000)."},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB14","series-title":"Computers in Railways VI","first-page":"597","article-title":"Constraint programming for real-time train circulation management problem in railway nodes","author":"Rodriguez","year":"1998"},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB15","unstructured":"U.I.C., Fiche 405r, Technical report, UIC (1978)."},{"key":"10.1016\/S1571-0661(04)00164-1_NEWBIB16","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\/S1571-0661(04)00164-1_NEWBIB17","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/S0377-2217(00)00087-4","article-title":"Routing trains through railway a station based on a node packing model","volume":"128","author":"Zwaneveld","year":"2001","journal-title":"European Journal of Operational Research"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001641?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001641?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T04:53:59Z","timestamp":1550206439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S1571066104001641"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00164-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}