Starts or continues probing variables and their bounds.
It returns:
- SatSolver::INFEASIBLE if the problem is proven infeasible.
- SatSolver::FEASIBLE when a feasible solution is found
- SatSolver::LIMIT_REACHED if the limit stored in the model is reached
Calling Probe() after it has returned FEASIBLE or LIMIT_REACHED will resume
probing from its previous state.
[[["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\u003eContinuousProber\u003c/code\u003e class in C++ repeatedly examines model variables, attempting to refine their bounds through probing and shaving techniques.\u003c/p\u003e\n"],["\u003cp\u003eIt utilizes the \u003ccode\u003eCpModelProto\u003c/code\u003e to identify variables for probing and interacts with the \u003ccode\u003eModel\u003c/code\u003e object.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eProbe\u003c/code\u003e method initiates or resumes the probing process, returning status indicators such as \u003ccode\u003eINFEASIBLE\u003c/code\u003e, \u003ccode\u003eFEASIBLE\u003c/code\u003e, or \u003ccode\u003eLIMIT_REACHED\u003c/code\u003e based on the probing outcomes.\u003c/p\u003e\n"],["\u003cp\u003eResuming probing after reaching \u003ccode\u003eFEASIBLE\u003c/code\u003e or \u003ccode\u003eLIMIT_REACHED\u003c/code\u003e continues from the previous state.\u003c/p\u003e\n"]]],["The `ContinuousProber` class iteratively probes and shaves bounds of model variables. It takes a `CpModelProto` and a `Model` as arguments to determine which variables to probe. The `Probe` method initiates or continues this process, returning the status of the solver: `INFEASIBLE` if infeasible, `FEASIBLE` if a solution is found, or `LIMIT_REACHED` if a limit is hit. Subsequent calls to `Probe` resume from the previous state.\n"],null,["# ContinuousProber\n\nC++ Reference: class ContinuousProber\n=====================================\n\n\nNote: This documentation is automatically generated.\nThis class will loop continuously on model variables and try to probe/shave its bounds.\n\n| Method ||\n|------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| [`ContinuousProber`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/integer_search.h#L286) | \u003cbr /\u003e Arguments: `const CpModelProto& model_proto, Model* model` The model_proto is just used to construct the lists of variable to probe. |\n| [`Probe`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/integer_search.h#L295) | Return type: `SatSolver::Status ` Starts or continues probing variables and their bounds. It returns: - SatSolver::INFEASIBLE if the problem is proven infeasible. - SatSolver::FEASIBLE when a feasible solution is found - SatSolver::LIMIT_REACHED if the limit stored in the model is reached Calling Probe() after it has returned FEASIBLE or LIMIT_REACHED will resume probing from its previous state. |"]]
