Couenne::CouenneBab Class Reference

#include <CouenneBab.hpp>

Inheritance diagram for Couenne::CouenneBab:
Inheritance graph
[legend]
Collaboration diagram for Couenne::CouenneBab:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 CouenneBab ()
 Integer optimization return codes.
virtual ~CouenneBab ()
 Destructor.
virtual void branchAndBound (Bonmin::BabSetupBase &s)
 Carry out branch and bound.
const double * bestSolution () const
 operator() performs the branchAndBound
void setProblem (CouenneProblem *p)
 operator() performs the branchAndBound
double bestObj () const
 return objective value of the bestSolution

Protected Attributes

CouenneProblemproblem_
 return Mip Status

Detailed Description

Definition at line 25 of file CouenneBab.hpp.


Constructor & Destructor Documentation

CouenneBab::CouenneBab (  ) 

Integer optimization return codes.

Constructor.

Constructor

Definition at line 77 of file CouenneBab.cpp.

CouenneBab::~CouenneBab (  )  [virtual]

Destructor.

Definition at line 96 of file CouenneBab.cpp.


Member Function Documentation

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 120 of file CouenneBab.cpp.

const double* Couenne::CouenneBab::bestSolution (  )  const [inline]

operator() performs the branchAndBound

operator() performs the branchAndBound 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 52 of file CouenneBab.hpp.

void CouenneBab::setProblem ( CouenneProblem p  ) 

operator() performs the branchAndBound

Definition at line 115 of file CouenneBab.cpp.

double Couenne::CouenneBab::bestObj (  )  const [inline]

return objective value of the bestSolution

Reimplemented from Bonmin::Bab.

Definition at line 60 of file CouenneBab.hpp.


Member Data Documentation

return Mip Status

return the best known lower bound on the objective value return the total number of nodes explored. return the total number of iterations in the last mip solved. returns the value of the continuous relaxation. virtual callback function to eventually modify objects for integer variable (replace with user set). This is called after CbcModel::findIntegers Get cbc model used to solve. Get cbc model used to solve as non-const, in case we want to change options before things happen Say that algorithm is using Couenne. Get value of usingCouenne variable.

Definition at line 124 of file CouenneBab.hpp.


The documentation for this class was generated from the following files:

Generated on 16 Feb 2012 by  doxygen 1.6.1