Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class FlowCoverCutHelper
Note: This documentation is automatically generated.
| Method |
ComputeFlowCoverRelaxation | Return type: SingleNodeFlow Arguments:
const LinearConstraint& base_ct,
const absl::StrongVector<IntegerVariable, double>& lp_values,
IntegerTrail* integer_trail, ImpliedBoundsProcessor* ib_helper Try to extract a nice SingleNodeFlow relaxation for the given upper bounded
linear constraint.
|
cut | Return type: const LinearConstraint& |
GenerateCut | 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().
|
Info | Return type: const std::string Single line of text that we append to the cut log line.
|
mutable_cut | Return type: LinearConstraint* If successful, info about the last generated cut.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2022-09-14 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
