TY - GEN A1 - Heinz, Stefan A1 - Schulz, Jens T1 - Explanations for the Cumulative Constraint: an Experimental Study N2 - In cumulative scheduling, conflict analysis seems to be one of the key ingredients to solve such problems efficiently. Thereby, the computational complexity of explanation algorithms plays an important role. Even more when we are faced with a backtracking system where explanations need to be constructed on the fly. In this paper we present extensive computational results to analyze the impact of explanation algorithms for the cumulative constraint in a backward checking system. The considered explanation algorithms differ in their quality and computational complexity. We present results for the domain propagation algorithms time-tabling, edge-finding, and energetic reasoning. T3 - ZIB-Report - 11-13 KW - conflict analysis KW - constraint integer programming KW - cumulative constraint KW - resource-constrained project scheduling KW - propagation algorithms Y1 - 2011 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1266 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-12668 ER -