C++ Reference: var_domination
Note: This documentation is automatically generated.
Classes |
|
|---|---|
| DualBoundStrengthening | |
| VarDomination | |
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 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eVarDomination constraint enforces that one variable is equal to the maximum of a set of other variables.\u003c/p\u003e\n"],["\u003cp\u003eDualBoundStrengthening is an algorithm that strengthens dual bounds of the problem by propagating information about variable dominations.\u003c/p\u003e\n"],["\u003cp\u003eThese classes can be used in optimization problems modeled using the OR-Tools CP-SAT solver.\u003c/p\u003e\n"]]],["The content describes two C++ classes: `DualBoundStrengthening` and `VarDomination`. These classes are found within the `sat` and `var_domination` subdirectories of an optimization library. The `DualBoundStrengthening` class and the `VarDomination` class are both outlined, providing core components for use in the related optimization context. No further details on specific actions or functionality are present within the provided content.\n"],null,["# var_domination\n\nC++ Reference: var_domination\n=============================\n\n\nNote: This documentation is automatically generated.\n\n| Classes ------- ||\n|---------------------------------------------------------------------------------------------|---|\n| [DualBoundStrengthening](/optimization/reference/sat/var_domination/DualBoundStrengthening) |\n| [VarDomination](/optimization/reference/sat/var_domination/VarDomination) |"]]