|  | Google OR-Tools v9.14
    a fast and portable software suite for combinatorial optimization | 
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.
(user): Avoid computing efficacity twice.
(user): We don't use any orthogonality consideration here.
(user): Detect duplicate cuts?
Definition at line 419 of file linear_constraint_manager.h.
#include <linear_constraint_manager.h>
| Public Member Functions | |
| TopNCuts (int n) | |
| void | AddCut (LinearConstraint ct, absl::string_view name, const util_intops::StrongVector< IntegerVariable, double > &lp_solution) | 
| Adds a cut to the local pool. | |
| void | TransferToManager (LinearConstraintManager *manager) | 
| Empty the local pool and add all its content to the manager. | |
| 
 | inlineexplicit | 
Definition at line 421 of file linear_constraint_manager.h.
| void operations_research::sat::TopNCuts::AddCut | ( | LinearConstraint | ct, | 
| absl::string_view | name, | ||
| const util_intops::StrongVector< IntegerVariable, double > & | lp_solution ) | 
Adds a cut to the local pool.
Definition at line 977 of file linear_constraint_manager.cc.
| void operations_research::sat::TopNCuts::TransferToManager | ( | LinearConstraintManager * | manager | ) | 
Empty the local pool and add all its content to the manager.
Definition at line 985 of file linear_constraint_manager.cc.