C++ Reference: class TopNCuts

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?

Return type: void

Arguments: LinearConstraint ct, const std::string& name, const absl::StrongVector<IntegerVariable, double>& lp_solution

Add a cut to the local pool


Return type: explicit

Arguments: int n


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.