15 #include "BonBabSetupBase.hpp"
const double * bestSolution() const
Get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).
virtual ~CouenneBab()
Destructor.
CouenneProblem * problem_
virtual void branchAndBound(Bonmin::BabSetupBase &s)
Carry out branch and bound.
Class for MINLP problems with symbolic information.
void setProblem(CouenneProblem *p)
double bestBound()
return the best known lower bound on the objective value
double bestObj() const
Return objective value of the bestSolution.