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