{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:34:41Z","timestamp":1770752081246,"version":"3.50.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319232188","type":"print"},{"value":"9783319232195","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_11","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"149-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Simple and Scalable Time-Table Filtering for the Cumulative Constraint"],"prefix":"10.1007","author":[{"given":"Steven","family":"Gay","sequence":"first","affiliation":[]},{"given":"Renaud","family":"Hartert","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"issue":"7","key":"11_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling 17(7), 57\u201373 (1993)","journal-title":"Mathematical and Computer Modelling"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-46135-3_5","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N Beldiceanu","year":"2002","unstructured":"Beldiceanu, N., Carlsson, M.: A New multi-resource $$cumulatives$$ constraint with negative heights. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 63\u201379. Springer, Heidelberg (2002)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1007\/978-3-540-74970-7_56","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L Bordeaux","year":"2007","unstructured":"Bordeaux, L., Hamadi, Y., Vardi, M.Y.: An analysis of slow convergence in interval propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 790\u2013797. Springer, Heidelberg (2007)"},{"key":"11_CR4","unstructured":"Charles Prud\u2019homme, X.L., Fages, J.-G.: Choco3 documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2014)"},{"key":"11_CR5","unstructured":"de Saint-Marcq, V.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: CP Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), pp. 1\u201310 (2013)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Fahimi, H., Quimper, C.-G.: Linear-time filtering algorithms for the disjunctive constraint. In: Twenty-Eighth AAAI Conference on Artificial Intelligence (2014)","DOI":"10.1609\/aaai.v28i1.9125"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11780441_5","volume-title":"Combinatorial Pattern Matching","author":"J Fischer","year":"2006","unstructured":"Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36\u201348. Springer, Heidelberg (2006)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-319-18008-3_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Gay","year":"2015","unstructured":"Gay, S., Hartert, R., Schaus, P.: Time-table disjunctive reasoning for the cumulative constraint. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 157\u2013172. Springer, Heidelberg (2015)"},{"key":"11_CR9","unstructured":"Gecode Team. Gecode: Generic constraint development environment (2006). http:\/\/www.gecode.org"},{"key":"11_CR10","unstructured":"Lecoutre, C., Hemery, F., et al.: A study of residual supports in arc consistency. In: IJCAI, vol. 7, pp. 125\u2013130 (2007)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-33558-7_33","volume-title":"Principles and Practice of Constraint Programming","author":"A Letort","year":"2012","unstructured":"Letort, A., Beldiceanu, N., Carlsson, M.: A Scalable Sweep Algorithm for the cumulative Constraint. In: Milano, M. (ed.) Principles and Practice of Constraint Programming. LNCS, pp. 439\u2013454. Springer, Heidelberg (2012)"},{"key":"11_CR12","unstructured":"Or-tools Team. or-tools: Google optimization tools (2015). https:\/\/developers.google.com\/optimization\/"},{"key":"11_CR13","unstructured":"OscaR Team. OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-642-40627-0_42","volume-title":"Principles and Practice of Constraint Programming","author":"P Ouellet","year":"2013","unstructured":"Ouellet, P., Quimper, C.-G.: Time-Table extended-edge-finding for the cumulative constraint. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 562\u2013577. Springer, Heidelberg (2013)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-21311-3_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Vil\u00edm","year":"2011","unstructured":"Vil\u00edm, P.: Timetable edge finding filtering algorithm for discrete cumulative resources. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 230\u2013245. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:51:07Z","timestamp":1676472667000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}