#include <CouenneBab.hpp>


Public Member Functions | |
| CouenneBab () | |
| Constructor. | |
| virtual | ~CouenneBab () |
| Destructor. | |
| void | setProblem (CouenneProblem *p) |
| virtual void | branchAndBound (Bonmin::BabSetupBase &s) |
| Carry out branch and bound. | |
| 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. | |
| double | bestBound () |
| return the best known lower bound on the objective value | |
Protected Attributes | |
| CouenneProblem * | problem_ |
Definition at line 21 of file CouenneBab.hpp.
| CouenneBab::CouenneBab | ( | ) |
Constructor.
Definition at line 74 of file CouenneBab.cpp.
| CouenneBab::~CouenneBab | ( | ) | [virtual] |
Destructor.
Definition at line 77 of file CouenneBab.cpp.
| void CouenneBab::setProblem | ( | CouenneProblem * | p | ) |
Definition at line 79 of file CouenneBab.cpp.
| void CouenneBab::branchAndBound | ( | Bonmin::BabSetupBase & | s | ) | [virtual] |
Carry out branch and bound.
Perform a branch-and-bound on given setup.
Reimplemented from Bonmin::Bab.
Definition at line 84 of file CouenneBab.cpp.
| const double * CouenneBab::bestSolution | ( | ) | const |
Get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).
If no solution is known returns NULL.
Reimplemented from Bonmin::Bab.
Definition at line 681 of file CouenneBab.cpp.
| double CouenneBab::bestObj | ( | ) | const |
Return objective value of the bestSolution.
Reimplemented from Bonmin::Bab.
Definition at line 691 of file CouenneBab.cpp.
| double Couenne::CouenneBab::bestBound | ( | ) | [inline] |
return the best known lower bound on the objective value
Reimplemented from Bonmin::Bab.
Definition at line 42 of file CouenneBab.hpp.
CouenneProblem* Couenne::CouenneBab::problem_ [protected] |
Definition at line 46 of file CouenneBab.hpp.
1.6.1