C++ Reference: class LbTreeSearch

Note: This documentation is automatically generated.

Implement a "classic" MIP tree search by having an exhaustive list of open nodes.

The goal of this subsolver is to improve the objective lower bound. It is meant to be used in a multi-thread portfolio, and as such it really do not care about finding solution. It is all about improving the lower bound.

TODO(user): What this is doing is really similar to asking a SAT solver if the current objective lower bound is reachable by solving a SAT problem. However, this code handle on the side all the "conflict" of the form objective > current_lb. As a result, when it is UNSAT, we can bump the lower bound by a bigger amount than one. We also do not completely loose everything learned so far for the next iteration.

Method
LbTreeSearch	Return type: explicit Arguments: Model* model
Search	Return type: SatSolver::Status Arguments: const std::function<void()>& feasible_solution_observer Explores the search space.