const double * bestSolution() const
Get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).
virtual ~CouenneBab()
Destructor.
A class to have all elements necessary to setup a branch-and-bound.
CouenneProblem * problem_
virtual void branchAndBound(Bonmin::BabSetupBase &s)
Carry out branch and bound.
double bestObj() const
Return objective value of the bestSolution.
Class for MINLP problems with symbolic information.
void fint fint fint fint fint fint fint fint fint fint real real real real real real real real * s
void setProblem(CouenneProblem *p)
double bestBound()
return the best known lower bound on the objective value
double bestBound()
return the best known lower bound on the objective value