{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:06:19Z","timestamp":1765609579277},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T00:00:00Z","timestamp":1385078400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10601-013-9157-z","type":"journal-article","created":{"date-parts":[[2013,11,24]],"date-time":"2013-11-24T23:50:41Z","timestamp":1385337041000},"page":"243-269","source":"Crossref","is-referenced-by-count":9,"title":["A quadratic edge-finding filtering algorithm for cumulative resource constraints"],"prefix":"10.1007","volume":"19","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","published-online":{"date-parts":[[2013,11,22]]},"reference":[{"issue":"7","key":"9157_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"issue":"1","key":"9157_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1), 119\u2013139.","journal-title":"Constraints"},{"key":"9157_CR3","doi-asserted-by":"crossref","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.P.M. (2001). Constraint-based scheduling: applying constraint programming to scheduling problems. Berlin: Springer."},{"issue":"2","key":"9157_CR4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J Carlier","year":"1994","unstructured":"Carlier, J., & Pinson, E. (1994). Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78(2), 146\u2013161.","journal-title":"European Journal of Operational Research"},{"key":"9157_CR5","first-page":"369","volume-title":"ICLP 1994\u2014logic programming","author":"Y Caseau","year":"1994","unstructured":"Caseau, Y., & Laburthe, F. (1994). Improved CLP scheduling with task intervals. In P. Van Hentenryck (Ed). ICLP 1994\u2014logic programming (pp. 369\u2013383). Cambridge: MIT Press."},{"key":"9157_CR6","unstructured":"Gecode. http:\/\/www.gecode.org . Accessed 30 Aug 2012."},{"key":"9157_CR7","doi-asserted-by":"crossref","unstructured":"Kameugne, R., & Fotso, L.P. (2013). A cumulative not-first\/not-last filtering algorithm in \ud835\udcaa ( n 2 log ( n ) ) $\\mathcal {O}(n^{2}\\log (n))$ . Indian Journal of Pure Applied Mathematics, 44(1), 95\u2013115 Springer, Berlin. doi: 10.1007\/s13226-013-0005-z .","DOI":"10.1007\/s13226-013-0005-z"},{"key":"9157_CR8","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/978-3-642-23786-7_37","volume-title":"CP 2011\u2014principles and practice of constraint programming, LNCS, Vol. 6876","author":"R Kameugne","year":"2011","unstructured":"Kameugne, R., Fotso, L.P., Scott, J., Ngo-Kateu, Y. (2011). A quadratic edge-finding filtering algorithm for cumulative resource constraints. In J.H.M. Lee (Ed.), CP 2011\u2014principles and practice of constraint programming, LNCS (Vol. 6876, pp. 478\u2013492). Berlin: Springer."},{"key":"9157_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R., & Sprecher, A. (1996). PSPLIB\u2013a project scheduling library. European Journal of Operational Research, 96, 205\u2013216.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9157_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/ijoc.1070.0226","volume":"20","author":"L Mercier","year":"2008","unstructured":"Mercier, L., & Van Hentenryck, P. (2008). Edge finding for cumulative scheduling. INFORMS Journal on Computing, 20(1), 143\u2013153.","journal-title":"INFORMS Journal on Computing"},{"key":"9157_CR11","unstructured":"Nuijten, W.P.M. (1994). Time and resource constrained scheduling. PhD thesis. Technische Universiteit Eindhoven."},{"key":"9157_CR12","unstructured":"PSPLib\u2014project scheduling problem library. http:\/\/129.187.106.231\/psplib\/ ."},{"key":"9157_CR13","unstructured":"Schulte, C., Tack, G., Lagerkvist, M.Z. (2012). Modeling. In C. Schulte, G. Tack, M.Z. Lagerkvist (Eds.), Modeling and programming with Gecode. Corresponds to Gecode 3.7.3."},{"key":"9157_CR14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-642-15396-9_36","volume-title":"CP 2010\u2014principles and practice of constraint programming, LNCS, Vol. 6308","author":"A Schutt","year":"2010","unstructured":"Schutt, A., & Wolf, A. (2010). A new O(n 2 log n) not-first\/not-last pruning algorithm for cumulative resource constraint. In D. Cohen (Ed.), CP 2010\u2014principles and practice of constraint programming, LNCS (Vol. 6308, pp. 445\u2013459). Berlin: Springer."},{"key":"9157_CR15","unstructured":"Scott, J. (2010). Filtering algorithms for discrete cumulative resources. Masters Thesis, Uppsala University, Sweden. http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:uu:diva-132172 ."},{"key":"9157_CR16","unstructured":"Vil\u00edm, P. (2007). Global constraints in scheduling. PhD thesis, Charles University in Prague."},{"key":"9157_CR17","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1007\/978-3-642-04244-7_62","volume-title":"CP 2009\u2014principles and practice of constraint programming, LNCS, Vol. 5732","author":"P Vil\u00edm","year":"2009","unstructured":"Vil\u00edm, P. (2009). Edge finding filtering algorithm for discrete cumulative resources in O ( kn log n ) $O(kn \\log n)$ . In I.P. Gent (Ed.), CP 2009\u2014principles and practice of constraint programming, LNCS (Vol. 5732, pp. 802\u2013816). Berlin: Springer."},{"key":"9157_CR18","first-page":"294","volume-title":"CPAIOR 2009\u2014integration of AI and OR techniques in constraint programming, LNCS, Vol.5547","author":"P Vil\u00edm","year":"2009","unstructured":"Vil\u00edm, P. (2009). Max energy filtering algorithm for discrete cumulative resources. In W.J. van Hoeve, & J.N. Hooker (Eds.), CPAIOR 2009\u2014integration of AI and OR techniques in constraint programming, LNCS (Vol. 5547, pp. 294\u2013308). Berlin: Springer."},{"key":"9157_CR19","first-page":"230","volume-title":"CPAIOR 2011\u2014integration of AI and OR techniques in constraint programming, LNCS, Vol. 6697","author":"P Vil\u00edm","year":"2011","unstructured":"Vil\u00edm, P. (2011). Timetable edge finding filtering algorithm for discrete cumulative resources. In T. Achterberg & J.C. Beck (Eds.), CPAIOR 2011\u2014integration of AI and OR techniques in constraint programming, LNCS (Vol. 6697, pp. 230\u2013245). Berlin: Springer."},{"key":"9157_CR20","first-page":"88","volume-title":"INAP 2005\u2014applications of declarative programming for knowledge management, LNCS, Vol. 4369","author":"A Wolf","year":"2006","unstructured":"Wolf, A., & Schrader, G. (2006). O(nlog n) overload checking for the cumulative constraint and its application. In M. Umeda, A. Wolf, O. Bartenstein, U. Geske, D. Seipel, O. Takata (Eds.), INAP 2005\u2014applications of declarative programming for knowledge management, LNCS (Vol. 4369, pp. 88\u2013101). Berlin: Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9157-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-013-9157-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9157-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:17Z","timestamp":1559243657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-013-9157-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,22]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9157"],"URL":"https:\/\/doi.org\/10.1007\/s10601-013-9157-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,22]]}}}