Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class TopNCuts
Note: This documentation is automatically generated.
Before adding cuts to the global pool, it is a classical thing to only keep
the top n of a given type during one generation round. This is there to help
doing that.
TODO(user): Avoid computing efficacity twice.
TODO(user): We don't use any orthogonality consideration here.
TODO(user): Detect duplicate cuts?
| Method |
AddCut | Return type: void Arguments: LinearConstraint ct, const std::string& name,
const absl::StrongVector<IntegerVariable, double>& lp_solution Add a cut to the local pool
|
TopNCuts | Return type: explicit Arguments: int n |
TransferToManager | Return type: void Arguments:
const absl::StrongVector<IntegerVariable, double>& lp_solution,
LinearConstraintManager* manager Empty the local pool and add all its content to the manager.
|
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 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["The `TopNCuts` class in C++ manages a local pool of cuts, keeping only the top *n* cuts of a specific type during each generation round before adding them to a global pool. Key actions include using the `AddCut` method to add a cut with a name and LP solution to the local pool. `TransferToManager` empties the local pool, transferring its contents to a designated manager. The class constructor, `TopNCuts`, takes an integer *n* to specify the maximum number of cuts to retain.\n"],null,[]]
