C++ Reference: class ImprovementSearchLimit

Note: This documentation is automatically generated.

Limit based on the improvement rate of 'objective_var'. This limit proceeds in two stages: 1) During the phase of the search in which the objective_var is strictly improving, a threshold value is computed as the minimum improvement rate of the objective, based on the 'improvement_rate_coefficient' and 'improvement_rate_solutions_distance' parameters. 2) Then, if the search continues beyond this phase of strict improvement, the limit stops the search when the improvement rate of the objective gets below this threshold value.

Method
AtSolution	Return type: bool
Check	Return type: bool
Copy	Return type: void Arguments: const SearchLimit* const limit
ImprovementSearchLimit	Arguments: Solver* const s, IntVar* objective_var, bool maximize, double objective_scaling_factor, double objective_offset, double improvement_rate_coefficient, int improvement_rate_solutions_distance
~ImprovementSearchLimit
Init	Return type: void
MakeClone	Return type: SearchLimit*