Send feedback
Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class CumulBoundsPropagator
Note: This documentation is automatically generated.
Utility class used in the core optimizer to tighten the cumul bounds as much
as possible based on the model precedences.
Method
CumulBoundsPropagator
Return type: explicit
Arguments: const RoutingDimension* dimension
CumulMax
Return type: int64_t
Arguments: int index
CumulMin
Return type: int64_t
Arguments: int index
dimension
Return type: const RoutingDimension&
PropagateCumulBounds
Return type: bool
Arguments:
const std::function<int64_t(int64_t)>& next_accessor,
int64_t cumul_offset
Tightens the cumul bounds starting from the current cumul var min/max,
and propagating the precedences resulting from the next_accessor, and the
dimension's precedence rules.
Returns false iff the precedences are infeasible with the given routes.
Otherwise, the user can call CumulMin() and CumulMax() to retrieve the new
bounds of an index.
Send feedback
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License , and code samples are licensed under the Apache 2.0 License . For details, see the Google Developers Site Policies . Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2022-09-14 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
Need to tell us more?