{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T03:30:15Z","timestamp":1787715015556,"version":"build-2784847793"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T00:00:00Z","timestamp":1496793600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10479-017-2543-y","type":"journal-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T11:14:07Z","timestamp":1496834047000},"page":"1165-1183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A greedy approach for a rolling stock management problem using multi-interval constraint propagation"],"prefix":"10.1007","volume":"271","author":[{"given":"Hugo","family":"Joudrier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florence","family":"Thiard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,7]]},"reference":[{"key":"2543_CR1","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S1574-6526(06)80020-9","volume":"2","author":"F Benhamou","year":"2006","unstructured":"Benhamou, F., & Granvilliers, L. (2006). Continuous and interval constraints. Foundations of Artificial Intelligence, 2, 571\u2013603.","journal-title":"Foundations of Artificial Intelligence"},{"issue":"11","key":"2543_CR2","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G Chabert","year":"2009","unstructured":"Chabert, G., & Jaulin, L. (2009). Contractor programming. Artificial Intelligence, 173(11), 1079\u20131100.","journal-title":"Artificial Intelligence"},{"issue":"6","key":"2543_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R. W. (1962). Algorithm 97: Shortest path. Communications of the ACM, 5(6), 345.","journal-title":"Communications of the ACM"},{"key":"2543_CR4","doi-asserted-by":"crossref","unstructured":"Hudak, P., Hughes, J., Peyton\u00a0Jones, S. & Wadler, P. (2007). A history of haskell: Being lazy with class. In Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages (pp. 12-1\u201312-55). ACM.","DOI":"10.1145\/1238844.1238856"},{"key":"2543_CR5","unstructured":"ILOG, S. (1999). Revising hull and box consistency. In Logic Programming: Proceedings of the 1999 International Conference on Logic Programming, (p. 230). MIT Press."},{"issue":"6","key":"2543_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/502949.502880","volume":"19","author":"T Johnsson","year":"1984","unstructured":"Johnsson, T. (1984). Efficient compilation of lazy evaluation. SIGPLAN Notices, 19(6), 58\u201369.","journal-title":"SIGPLAN Notices"},{"issue":"3\u20134","key":"2543_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02307379","volume":"53","author":"O Kn\u00fcppel","year":"1994","unstructured":"Kn\u00fcppel, O. (1994). Profil\/biasa fast interval library. Computing, 53(3\u20134), 277\u2013287.","journal-title":"Computing"},{"issue":"2","key":"2543_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/1141885.1141893","volume":"32","author":"M Lerch","year":"2006","unstructured":"Lerch, M., Tischler, G., Gudenberg, J. W. V., Hofschuster, W., & Kr\u00e4mer, W. (2006). Filib++, a fast interval library supporting containment computations. ACM Transactions on Mathematical Software (TOMS), 32(2), 299\u2013324.","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"issue":"1","key":"2543_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0004-3702(99)00062-4","volume":"113","author":"AL Madsen","year":"1999","unstructured":"Madsen, A. L., & Jensen, F. V. (1999). Lazy propagation: A junction tree inference algorithm based on lazy evaluation. Artificial Intelligence, 113(1), 203\u2013245.","journal-title":"Artificial Intelligence"},{"key":"2543_CR10","series-title":"Prentice-Hall series in automatic computation","volume-title":"Interval analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R. E. (1966). Interval analysis., Prentice-Hall series in automatic computation Englewood Cliffs: Prentice-Hall."},{"key":"2543_CR11","unstructured":"Ninin, J. (2015). Global optimization based on contractor programming: An overview of the ibex library. In International Conference on Mathematical Aspects of Computer and Information Sciences (pp. 555\u2013559). Springer."},{"key":"2543_CR12","unstructured":"Ramond, F., & Marcos, N. (2014). Trains don\u2019t vanish ! ROADEF EURO 2014 challenge problem description. Technical report, SNCF\u2014Innovation & Research Department. \n                        https:\/\/hal.archives-ouvertes.fr\/hal-01057324\n                        \n                    ."},{"issue":"4","key":"2543_CR13","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.39.4.553","volume":"39","author":"DF Rogers","year":"1991","unstructured":"Rogers, D. F., Plante, R. D., Wong, R. T., & Evans, J. R. (1991). Aggregation and disaggregation techniques and methodology in optimization. Operations Research, 39(4), 553\u2013582.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2543-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2543-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2543-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T04:34:00Z","timestamp":1542947640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2543-y"}},"subtitle":["ROADEF\/EURO challenge 2014"],"short-title":[],"issued":{"date-parts":[[2017,6,7]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2543"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2543-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,7]]}}}