Class IloCplex::SearchLimit

Search limits can be used to impose limits on the exploration of certain subtrees during branch & cut search. Search limits are implemented in the class IloCplex::SearchLimitI. This is the handle class for CPLEX search limits.

The search limit objects are reference-counted. This means an instance of IloCplex::SearchLimitI keeps track of how many handle objects refer to it. If this number drops to 0, the IloCplex::SearchLimitI object is automatically deleted. As a consequence, whenever you deal with a search limit, you must maintain a handle object rather then only a pointer to the implementation object. Otherwise, you risk ending up with a pointer to an implementation object that has already been deleted.

The default constructor creates a new search limit with 0 implementation object pointer.

This constructor creates a new search limit with a pointer to an implementation. It increases the reference count of impl by one.

This copy constructor increments the reference count of the implementation object referenced by limit by one.

The destructor decreases the reference count of impl by one. If this reduces the reference count to 0, the implementation object is automatically deleted.

Queries the implementation object of the invoking search limit.

The assignment operator increases the reference count of the implementation object of limit. If the invoking handle referred to an implementation object before the assignment operation, its reference count is decreased. If this reduces the reference count to 0, the implementation object is deleted.