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

#include <BonDiver.hpp>

Public Member Functions
	CbcProbedDiver ()
	Default constructor.
	CbcProbedDiver (const CbcProbedDiver &rhs)
	Copy constructor.
CbcProbedDiver &	operator= (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.
Private Attributes
bool	treeCleaning_
	Say if we are cleaning the tree (then only call CbcTree functions).
CbcNode *	nextOnBranch_
	Next node on the branch.
CbcNode *	candidateChild_
	Candidate child explored.
bool	stop_diving_on_cutoff_
	Flag indicating if we want to stop diving based on the guessed objective value and the cutoff value.

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

Bonmin::CbcProbedDiver::CbcProbedDiver ( )

Default constructor.

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

Copy constructor.

virtual Bonmin::CbcProbedDiver::~CbcProbedDiver ( ) [virtual]

Destructor.

Member Function Documentation

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

Assignment operator.

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

Virtual copy constructor.

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

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

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

Add node to the heap.

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

Remove the top node of the heap.

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

Remove the best node from the heap and return it.

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

Test if empty.

virtual int Bonmin::CbcProbedDiver::size ( ) [inline, virtual]

Give size of the tree.

Definition at line 144 of file BonDiver.hpp.

References candidateChild_, and nextOnBranch_.

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.

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

Get best possible objective function in the tree.

virtual void Bonmin::CbcProbedDiver::endSearch ( ) [inline, virtual]

Don't know what this is yet?

Definition at line 164 of file BonDiver.hpp.

References nextOnBranch_.

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

Initialize the method (get options)