Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class CumulativeIsAfterSubsetConstraint
Note: This documentation is automatically generated.
Given that the "tasks" are part of a cumulative constraint, this adds a
constraint that propagate the fact that: var >= max(end of substasks) +
offset.
TODO(user): I am not sure this is the best way, but it does at least push
the level zero bound on the large cumulative instances.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[],["The `CumulativeIsAfterSubsetConstraint` class in C++ enforces that a variable (`var`) is greater than or equal to the maximum end time of a subset of tasks (`subtasks`) plus an offset. It aims to push the bound on large cumulative instances. Key methods include the constructor, `Propagate` (returns a boolean), and `RegisterWith` (registers with a watcher). The constraint is defined using integer variables, affine expressions, task subsets, offsets, and helper classes.\n"]]