{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:52:07Z","timestamp":1773143527877,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237850","type":"print"},{"value":"9783642237867","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_37","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T03:58:42Z","timestamp":1314763122000},"page":"478-492","source":"Crossref","is-referenced-by-count":9,"title":["A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints"],"prefix":"10.1007","author":[{"given":"Roger","family":"Kameugne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laure Pauline","family":"Fotso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youcheu","family":"Ngo-Kateu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BFb0017454","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"P. Baptiste","year":"1997","unstructured":"Baptiste, P., Le Pape, C.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 375\u2013389. Springer, Heidelberg (1997)"},{"key":"37_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling: applying constraint programming to scheduling problems","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems. Kluwer, Boston (2001)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J., Pinson, E.: Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research\u00a078, 146\u2013161 (1994)","journal-title":"European Journal of Operational Research"},{"key":"37_CR4","first-page":"369","volume-title":"ICLP94","author":"Y. Caseau","year":"1994","unstructured":"Caseau, Y., Laburthe, F.: Improved CLP scheduling with task intervals. In: Van Hentenryck, P. (ed.) ICLP94, pp. 369\u2013383. MIT Press, Boston (1994)"},{"key":"37_CR5","unstructured":"Gecode Team: Gecode, a generic constraint development environment (2006), \n                    \n                      http:\/\/www.gecode.org"},{"key":"37_CR6","unstructured":"Kameugne, R., Fotso, L.P.: A not-first\/not-last algorithm for cumulative resource in \n                    \n                      \n                    \n                    $\\mathcal{O}(n^2\\log n)$\n                   (2010) (accepted to CP 2010 Doctoral Program)"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R. Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB \u2013 A project scheduling problem library. European Journal of Operational Research\u00a096(1), 205\u2013216 (1997)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/ijoc.1070.0226","volume":"20","author":"L. Mercier","year":"2008","unstructured":"Mercier, L., Van Hentenryck, P.: Edge finding for cumulative scheduling. INFORMS Journal on Computing\u00a020(1), 143\u2013153 (2008)","journal-title":"INFORMS Journal on Computing"},{"key":"37_CR9","unstructured":"Nuijten, W.: Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Eindhoven University of Technology (1994)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-15396-9_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"A. Schutt","year":"2010","unstructured":"Schutt, A., Wolf, A.: A New \n                    \n                      \n                    \n                    $\\mathcal{O}(n^2\\log n)$\n                   Not-First\/Not-Last Pruning Algorithm for Cumulative Resource Constraints. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 445\u2013459. Springer, Heidelberg (2010)"},{"key":"37_CR11","unstructured":"Vil\u00edm, P.: Global constraints in scheduling. PhD thesis, Charles University, Prague (2007)"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-01929-6_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vil\u00edm","year":"2009","unstructured":"Vil\u00edm, P.: Max energy filtering algorithm for discrete cumulative resources. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 66\u201380. Springer, Heidelberg (2009)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/978-3-642-04244-7_62","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"P. Vil\u00edm","year":"2009","unstructured":"Vil\u00edm, P.: Edge Finding Filtering Algorithm for Discrete Cumulative Resources in \n                    \n                      \n                    \n                    $\\mathcal{O}(kn\\log n)$\n                  . In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 802\u2013816. Springer, Heidelberg (2009)"},{"key":"37_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11963578_8","volume-title":"Declarative Programming for Knowledge Management","author":"A. Wolf","year":"2006","unstructured":"Wolf, A., Schrader, G.: \n                    \n                      \n                    \n                    $\\mathcal{O}(n \\log n)$\n                   overload checking for the cumulative constraint and its application. In: Umeda, M., Wolf, A., Bartenstein, O., Geske, U., Seipel, D., Takata, O., et al. (eds.) INAP 2005. LNCS (LNAI), vol.\u00a04369, pp. 88\u2013101. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T12:29:30Z","timestamp":1554121770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}