Bonmin 1.8.9
Loading...
Searching...
No Matches
Bonmin::CbcProbedDiver Class Reference

Class to do probed diving in the tree. More...

#include <BonDiver.hpp>

+ Inheritance diagram for Bonmin::CbcProbedDiver:
+ Collaboration diagram for Bonmin::CbcProbedDiver:

Public Member Functions

 CbcProbedDiver ()
 Default constructor.
 
 CbcProbedDiver (const CbcProbedDiver &rhs)
 Copy constructor.
 
CbcProbedDiveroperator= (const CbcProbedDiver &rhs)
 Assignment operator.
 
virtual ~CbcProbedDiver ()
 Destructor.
 
virtual CbcTree * clone () const
 Virtual copy constructor.
 
virtual void cleanTree (CbcModel *model, double cutoff, double &bestPossibleObjective)
 Prune the tree using an objective function cutoff.
 
virtual double getBestPossibleObjective ()
 Get best possible objective function in the tree.
 
virtual void endSearch ()
 Don't know what this is yet?
 
void initialize (BabSetupBase &b)
 Initialize the method (get options)
 
Heap access and maintenance methods.
virtual CbcNode * top () const
 Return top node (next node to process.*‍/.
 
virtual void push (CbcNode *x)
 Add node to the heap.
 
virtual void pop ()
 Remove the top node of the heap.
 
virtual CbcNode * bestNode (double cutoff)
 Remove the best node from the heap and return it.
 
vector methods
virtual bool empty ()
 Test if empty.
 
virtual int size ()
 Give size of the tree.
 

Detailed Description

Class to do probed diving in the tree.

Principle is that branch-and-bound follows current branch of the tree by exploring the two children at each level and continuing the dive on the best one of the two. Untill it hits the bottom at which point it goes to the best candidate (according to CbcCompare) on the heap.

Definition at line 108 of file BonDiver.hpp.

Constructor & Destructor Documentation

◆ CbcProbedDiver() [1/2]

Bonmin::CbcProbedDiver::CbcProbedDiver ( )

Default constructor.

◆ CbcProbedDiver() [2/2]

Bonmin::CbcProbedDiver::CbcProbedDiver ( const CbcProbedDiver & rhs)

Copy constructor.

◆ ~CbcProbedDiver()

virtual Bonmin::CbcProbedDiver::~CbcProbedDiver ( )
virtual

Destructor.

Member Function Documentation

◆ operator=()

CbcProbedDiver & Bonmin::CbcProbedDiver::operator= ( const CbcProbedDiver & rhs)

Assignment operator.

◆ clone()

virtual CbcTree * Bonmin::CbcProbedDiver::clone ( ) const
virtual

Virtual copy constructor.

◆ top()

virtual CbcNode * Bonmin::CbcProbedDiver::top ( ) const
virtual

Return top node (next node to process.*‍/.

◆ push()

virtual void Bonmin::CbcProbedDiver::push ( CbcNode * x)
virtual

Add node to the heap.

◆ pop()

virtual void Bonmin::CbcProbedDiver::pop ( )
virtual

Remove the top node of the heap.

◆ bestNode()

virtual CbcNode * Bonmin::CbcProbedDiver::bestNode ( double cutoff)
virtual

Remove the best node from the heap and return it.

◆ empty()

virtual bool Bonmin::CbcProbedDiver::empty ( )
virtual

Test if empty.

◆ size()

virtual int Bonmin::CbcProbedDiver::size ( )
inlinevirtual

Give size of the tree.

Definition at line 144 of file BonDiver.hpp.

◆ cleanTree()

virtual void Bonmin::CbcProbedDiver::cleanTree ( CbcModel * model,
double cutoff,
double & bestPossibleObjective )
virtual

Prune the tree using an objective function cutoff.

This routine removes all nodes with objective worst than the specified cutoff value. It also sets bestPossibleObjective to best of all on tree before deleting.

◆ getBestPossibleObjective()

virtual double Bonmin::CbcProbedDiver::getBestPossibleObjective ( )
virtual

Get best possible objective function in the tree.

◆ endSearch()

virtual void Bonmin::CbcProbedDiver::endSearch ( )
inlinevirtual

Don't know what this is yet?

Definition at line 164 of file BonDiver.hpp.

◆ initialize()

void Bonmin::CbcProbedDiver::initialize ( BabSetupBase & b)

Initialize the method (get options)


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