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