[[["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\u003e\u003ccode\u003eFlowCoverCutHelper\u003c/code\u003e assists in generating cuts for the single node flow problem based on a given linear constraint and LP values.\u003c/p\u003e\n"],["\u003cp\u003eThe core functionality involves computing a flow cover relaxation (\u003ccode\u003eComputeFlowCoverRelaxation\u003c/code\u003e) and subsequently attempting to generate a cut (\u003ccode\u003eGenerateCut\u003c/code\u003e).\u003c/p\u003e\n"],["\u003cp\u003eIf a cut is successfully generated, it can be accessed via the \u003ccode\u003ecut()\u003c/code\u003e or \u003ccode\u003emutable_cut()\u003c/code\u003e methods, along with associated information (\u003ccode\u003eInfo\u003c/code\u003e).\u003c/p\u003e\n"]]],["The `FlowCoverCutHelper` class in C++ facilitates generating cuts for optimization problems. It includes methods to `ComputeFlowCoverRelaxation` for extracting a `SingleNodeFlow` relaxation from a linear constraint. The `GenerateCut` method attempts to produce a cut for a given `SingleNodeFlow`, returning true if successful. Generated cut details are accessible via `cut()` or `mutable_cut()`. Additional info for logging is provided by the `Info` method.\n"],null,["# FlowCoverCutHelper\n\nC++ Reference: class FlowCoverCutHelper\n=======================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| [`ComputeFlowCoverRelaxation`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/cuts.h#L213) | Return type: `SingleNodeFlow ` Arguments: ` const LinearConstraint& base_ct, const absl::StrongVector\u003cIntegerVariable, double\u003e& lp_values, IntegerTrail* integer_trail, ImpliedBoundsProcessor* ib_helper` Try to extract a nice SingleNodeFlow relaxation for the given upper bounded linear constraint. |\n| [`cut`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/cuts.h#L224) | Return type: `const LinearConstraint& ` \u003cbr /\u003e |\n| [`GenerateCut`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/cuts.h#L220) | Return type: `bool ` Arguments: `const SingleNodeFlow& data` Try to generate a cut for the given single node flow problem. Returns true if a cut was generated. It can be accessed by cut()/mutable_cut(). |\n| [`Info`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/cuts.h#L227) | Return type: `const std::string ` Single line of text that we append to the cut log line. |\n| [`mutable_cut`](https://github.com/google/or-tools/blob/v9.4/ortools/sat/cuts.h#L223) | Return type: `LinearConstraint* ` If successful, info about the last generated cut. |"]]
