[[["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\u003eThe \u003ccode\u003eBoundedVariableElimination\u003c/code\u003e class is used for inprocessing within the or-tools SAT solver and is constructed with a pointer to the relevant \u003ccode\u003eModel\u003c/code\u003e.\u003c/p\u003e\n"],["\u003cp\u003eIt features a primary method, \u003ccode\u003eDoOneRound\u003c/code\u003e, which attempts a single round of variable elimination based on bounds and returns \u003ccode\u003etrue\u003c/code\u003e if any modifications were made to the model.\u003c/p\u003e\n"]]],["The `BoundedVariableElimination` class in C++ offers methods for constraint optimization. The core functionality is implemented within the `DoOneRound` method, which takes a boolean `log_info` argument and returns a boolean indicating if a round of processing has been done. The class constructor `BoundedVariableElimination` takes a `Model*` argument. This documentation describes the class and two core methods for constraint optimization.\n"],null,[]]
