T CoinMin(const T x1, const T x2)
void setProblem(CouenneProblem *p)
virtual ~CouenneBab()
Destructor.
const double * bestSolution() const
Get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).
double bestBound()
return the best known lower bound on the objective value
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.
general include file for different compilers