Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class LinMinPropagator
Note: This documentation is automatically generated.
Same as MinPropagator except this works on min = MIN(exprs) where exprs are
linear expressions. It uses IntegerSumLE to propagate bounds on the exprs.
Assumes Canonical expressions (all positive coefficients).
[[["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."],[[["\u003cp\u003eLinMinPropagator is a class in OR-Tools that efficiently handles the minimum of a set of linear expressions, similar to MinPropagator, but specifically designed for linear expressions using IntegerSumLE for bound propagation.\u003c/p\u003e\n"],["\u003cp\u003eIt operates under the assumption that all expressions are in canonical form, meaning they have positive coefficients.\u003c/p\u003e\n"],["\u003cp\u003eThe constructor requires a vector of linear expressions, the integer variable representing the minimum, and a pointer to the model.\u003c/p\u003e\n"],["\u003cp\u003eLinMinPropagator offers functionalities like propagation of bounds (\u003ccode\u003ePropagate\u003c/code\u003e) and registration with a literal watcher (\u003ccode\u003eRegisterWith\u003c/code\u003e).\u003c/p\u003e\n"]]],["`LinMinPropagator` handles min operations on linear expressions (min = MIN(exprs)). It employs `IntegerSumLE` for bound propagation, assuming canonical expressions with positive coefficients. Key actions include instantiation with linear expressions, a minimum variable, and a model. The `Propagate` method returns a boolean, and `RegisterWith` takes a `GenericLiteralWatcher`. Copy and assignment operators are deleted.\n"],null,["# LinMinPropagator\n\nC++ Reference: class LinMinPropagator\n=====================================\n\n\nNote: This documentation is automatically generated.\nSame as MinPropagator except this works on min = MIN(exprs) where exprs are linear expressions. It uses IntegerSumLE to propagate bounds on the exprs. Assumes Canonical expressions (all positive coefficients).\n\n| Method ||\n|----------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------|\n| [`LinMinPropagator`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/integer_expr.h#L203) | \u003cbr /\u003e Arguments: `const std::vector\u003cLinearExpression\u003e& exprs, IntegerVariable min_var, Model* model` \u003cbr /\u003e |\n| [`LinMinPropagator`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/integer_expr.h#L205) | \u003cbr /\u003e Arguments: `const LinMinPropagator&) = delete; LinMinPropagator& operator=(const LinMinPropagator&) = delete; bool Propagate(` \u003cbr /\u003e |\n| [`Propagate`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/integer_expr.h#L208) | Return type: `bool ` \u003cbr /\u003e |\n| [`RegisterWith`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/integer_expr.h#L209) | Return type: `void ` Arguments: `GenericLiteralWatcher* watcher` \u003cbr /\u003e |"]]
