{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T05:44:52Z","timestamp":1789191892593,"version":"build-2803163510"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_32","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T15:12:23Z","timestamp":1471878743000},"page":"493-519","source":"Crossref","is-referenced-by-count":8,"title":["A Nearly Exact Propagation Algorithm for Energetic Reasoning in $$\\mathcal O(n^2 \\log n)$$"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Tesch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"issue":"3","key":"32_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10951-014-0404-y","volume":"18","author":"C Artigues","year":"2015","unstructured":"Artigues, C., Lopez, P.: Energetic reasoning for energy-constrained scheduling with a continuous resource. J. Sched. 18(3), 225\u2013241 (2015)","journal-title":"J. Sched."},{"key":"32_CR2","unstructured":"Bonifas, N.: A $$O(n^2 log(n))$$ propagation for the energy reasoning. In: Conference Paper, Roadef 2016 (2016)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-319-10428-7_22","volume-title":"Principles and Practice of Constraint Programming","author":"A Derrien","year":"2014","unstructured":"Derrien, A., Petit, T.: A new characterization of relevant intervals for energetic reasoning. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 289\u2013297. Springer, Heidelberg (2014)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-642-19754-3_23","volume-title":"Theory and Practice of Algorithms in (Computer) Systems","author":"T Berthold","year":"2011","unstructured":"Berthold, T., Heinz, S., Schulz, J.: An approximative criterion for the potential of energetic reasoning. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 229\u2013239. Springer, Heidelberg (2011)"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Satisfiability tests and time bound adjustments for cumulative scheduling problems. Ann. Oper. Res. 92, 305\u2013333 (1999)","journal-title":"Ann. Oper. Res."},{"key":"32_CR6","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Applying Constraint Programming to Scheduling Problems, vol. 39. Springer Science & Business Media (2012)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P.: Edge finding filtering algorithm for discrete cumulative resources in\u00a0 $$\\cal O$$ (kn log n). In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 802\u2013816. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04244-7_62"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3","key":"32_CR9","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints 16(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Schutt, A., Wolf, A.: A new $$\\cal O$$ ( $${n^2}$$ log n) not-first\/not-last pruning algorithm for cumulative resource constraints. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 445\u2013459. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15396-9_36"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-642-38171-3_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J.: Explaining time-table-edge-finding propagation for the cumulative resource constraint. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 234\u2013250. Springer, Heidelberg (2013)"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3","key":"32_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10601-013-9157-z","volume":"19","author":"R Kameugne","year":"2014","unstructured":"Kameugne, R., Fotso, L.P., Scott, J., Ngo-Kateu, Y.: A quadratic edge-finding filtering algorithm for cumulative resource constraints. Constraints 19(3), 243\u2013269 (2014)","journal-title":"Constraints"},{"issue":"1","key":"32_CR14","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.: Edge finding for cumulative scheduling. INFORMS J. Comput. 20(1), 143\u2013153 (2008)","journal-title":"INFORMS J. Comput."},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.) CP 2012. LNCS, vol. 7514, pp. 439\u2013454. Springer, Heidelberg (2012)"},{"issue":"1","key":"32_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"32_CR17","unstructured":"Godard, D., Laborie, P., Nuijten, W.: Randomized large neighborhood search for cumulative scheduling. In: ICAPS, vol. 5, pp. 81\u201389, June 2005"},{"key":"32_CR18","unstructured":"HP Peter Stuckey. http:\/\/people.eng.unimelb.edu.au\/pstuckey\/rcpsp\/"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T21:12:56Z","timestamp":1568322776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}