Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class LevelZeroEquality
Note: This documentation is automatically generated.
This assumes target = SUM_i coeffs[i] * vars[i], and detects that the target
must be of the form (a*X + b).
This propagator is quite specific and runs only at level zero. For now, this
is mainly used for the objective variable. As we fix terms with high
objective coefficient, it is possible the only terms left have a common
divisor. This close app2-2.mps in less than a second instead of running
forever to prove the optimal (in single thread).
[[["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 LevelZeroEquality propagator in C++ identifies and exploits linear relationships within a target expression during constraint programming."],["It specifically targets expressions where the target is a linear combination of variables, potentially with a common divisor among the coefficients."],["This propagator primarily operates at the root node of the search tree (level zero) and proves beneficial in scenarios like optimizing objective functions with fixed terms."],["Utilizing this propagator can significantly reduce solving time, as demonstrated by its ability to solve the app2-2.mps instance efficiently."],["It's implemented as a class with methods to initialize with target, variables, and coefficients, and to execute the propagation logic."]]],[]]
