#include <CbcTreeLocal.hpp>

Inheritance diagram for CbcTreeVariable:

Collaboration diagram for CbcTreeVariable:

Public Member Functions
	CbcTreeVariable ()

	CbcTreeVariable (CbcModel model, const double solution, int range=10, int typeCuts=0, int maxDiversification=0, int timeLimit=1000000, int nodeLimit=1000000, bool refine=true)

	CbcTreeVariable (const CbcTreeVariable &rhs)

CbcTreeVariable &	operator= (const CbcTreeVariable &rhs)

virtual	~CbcTreeVariable ()

virtual CbcTree *	clone () const
	Clone. More...

virtual void	generateCpp (FILE *fp)
	Create C++ lines to get to current state. More...

Heap access and maintenance methods
virtual CbcNode *	top () const
	Return the top node of the heap. More...

virtual void	push (CbcNode *x)
	Add a node to the heap. More...

virtual void	pop ()
	Remove the top node from the heap. More...

Public Member Functions inherited from CbcTree
	CbcTree ()
	Default Constructor. More...

	CbcTree (const CbcTree &rhs)
	Copy constructor. More...

CbcTree &	operator= (const CbcTree &rhs)
	= operator More...

virtual	~CbcTree ()
	Destructor. More...

void	setComparison (CbcCompareBase &compare)
	Set comparison function and resort heap. More...

virtual CbcNode *	bestNode (double cutoff)
	Gets best node and takes off heap. More...

virtual void	rebuild ()
	Rebuild the heap. More...

virtual int	size () const
	Return size. More...

CbcNode *	operator[] (int i) const
	Return a node pointer. More...

CbcNode *	nodePointer (int i) const
	Return a node pointer. More...

void	realpop ()

void	fixTop ()
	After changing data in the top node, fix the heap. More...

void	realpush (CbcNode *node)

virtual void	cleanTree (CbcModel *model, double cutoff, double &bestPossibleObjective)
	Prune the tree using an objective function cutoff. More...

CbcNode *	bestAlternate ()
	Get best on list using alternate method. More...

virtual double	getBestPossibleObjective ()
	Get best possible objective function in the tree. More...

void	resetNodeNumbers ()
	Reset maximum node number. More...

int	maximumNodeNumber () const
	Get maximum node number. More...

void	setNumberBranching (int value)
	Set number of branches. More...

int	getNumberBranching () const
	Get number of branches. More...

void	setMaximumBranching (int value)
	Set maximum branches. More...

int	getMaximumBranching () const
	Get maximum branches. More...

unsigned int *	branched () const
	Get branched variables. More...

int *	newBounds () const
	Get bounds. More...

double	lastObjective () const
	Last objective in branch-and-cut search tree. More...

int	lastDepth () const
	Last depth in branch-and-cut search tree. More...

int	lastUnsatisfied () const
	Last number of objects unsatisfied. More...

void	addBranchingInformation (const CbcModel model, const CbcNodeInfo nodeInfo, const double currentLower, const double currentUpper)
	Adds branching information to complete state. More...

void	increaseSpace ()
	Increase space for data. More...

Other stuff
CbcNode *	localNode_

double *	bestSolution_

double *	savedSolution_

int	saveNumberSolutions_

OsiRowCut	cut_

OsiRowCut	fixedCut_

CbcModel *	model_

double *	originalLower_

double *	originalUpper_

int	range_

int	typeCuts_

int	maxDiversification_

int	diversification_

bool	nextStrong_

double	rhs_

double	savedGap_

double	bestCutoff_

int	timeLimit_

int	startTime_

int	nodeLimit_

int	startNode_

int	searchType_

bool	refine_

int	createCut (const double *solution, OsiRowCut &cut)
	Create cut - return -1 if bad, 0 if okay and 1 if cut is everything. More...

virtual bool	empty ()
	Test if empty *** note may be overridden. More...

virtual void	endSearch ()
	We may have got an intelligent tree so give it one more chance. More...

void	reverseCut (int state, double bias=0.0)
	Other side of last cut branch (if bias==rhs_ will be weakest possible) More...

void	deleteCut (OsiRowCut &cut)
	Delete last cut branch. More...

void	passInSolution (const double *solution, double solutionValue)
	Pass in solution (so can be used after heuristic) More...

int	range () const

void	setRange (int value)

int	typeCuts () const

void	setTypeCuts (int value)

int	maxDiversification () const

void	setMaxDiversification (int value)

int	timeLimit () const

void	setTimeLimit (int value)

int	nodeLimit () const

void	setNodeLimit (int value)

bool	refine () const

void	setRefine (bool yesNo)

Additional Inherited Members
Protected Attributes inherited from CbcTree
std::vector< CbcNode * >	nodes_
	Storage vector for the heap. More...

CbcCompare	comparison_
	Sort predicate for heap ordering. More...

int	maximumNodeNumber_
	Maximum "node" number so far to split ties. More...

int	numberBranching_
	Size of variable list. More...

int	maximumBranching_
	Maximum size of variable list. More...

double	lastObjective_
	Objective of last node pushed on tree. More...

int	lastDepth_
	Depth of last node pushed on tree. More...

int	lastUnsatisfied_
	Number unsatisfied of last node pushed on tree. More...

unsigned int *	branched_
	Integer variables branched or bounded top bit set if new upper bound next bit set if a branch. More...

int *	newBound_
	New bound. More...

Detailed Description

Definition at line 215 of file CbcTreeLocal.hpp.

Constructor & Destructor Documentation

◆ CbcTreeVariable() [1/3]

CbcTreeVariable::CbcTreeVariable ( )

◆ CbcTreeVariable() [2/3]

CbcTreeVariable::CbcTreeVariable	(	CbcModel *	model,
		const double *	solution,
		int	range = `10`,
		int	typeCuts = `0`,
		int	maxDiversification = `0`,
		int	timeLimit = `1000000`,
		int	nodeLimit = `1000000`,
		bool	refine = `true`
	)

◆ CbcTreeVariable() [3/3]

CbcTreeVariable::CbcTreeVariable ( const CbcTreeVariable & rhs )

◆ ~CbcTreeVariable()

virtual CbcTreeVariable::~CbcTreeVariable ( )

virtual

Member Function Documentation

◆ operator=()

CbcTreeVariable& CbcTreeVariable::operator= ( const CbcTreeVariable & rhs )

◆ clone()

virtual CbcTree* CbcTreeVariable::clone ( ) const

virtual

Clone.

Reimplemented from CbcTree.

◆ generateCpp()

virtual void CbcTreeVariable::generateCpp ( FILE * fp )

virtual

Create C++ lines to get to current state.

Reimplemented from CbcTree.

◆ top()

virtual CbcNode* CbcTreeVariable::top ( ) const

virtual

Return the top node of the heap.

Reimplemented from CbcTree.

◆ push()

virtual void CbcTreeVariable::push ( CbcNode * x )

virtual

Add a node to the heap.

Reimplemented from CbcTree.

◆ pop()

virtual void CbcTreeVariable::pop ( )

virtual

Remove the top node from the heap.

Reimplemented from CbcTree.

◆ createCut()

int CbcTreeVariable::createCut	(	const double *	solution,
		OsiRowCut &	cut
	)

Create cut - return -1 if bad, 0 if okay and 1 if cut is everything.

◆ empty()

virtual bool CbcTreeVariable::empty ( )

virtual

Test if empty *** note may be overridden.

Reimplemented from CbcTree.

◆ endSearch()

virtual void CbcTreeVariable::endSearch ( )

virtual

We may have got an intelligent tree so give it one more chance.

Reimplemented from CbcTree.

◆ reverseCut()

void CbcTreeVariable::reverseCut	(	int	state,
		double	bias = `0.0`
	)

Other side of last cut branch (if bias==rhs_ will be weakest possible)

◆ deleteCut()

void CbcTreeVariable::deleteCut ( OsiRowCut & cut )

Delete last cut branch.

◆ passInSolution()

void CbcTreeVariable::passInSolution	(	const double *	solution,
		double	solutionValue
	)

Pass in solution (so can be used after heuristic)

◆ range()

int CbcTreeVariable::range ( ) const

inline

Definition at line 281 of file CbcTreeLocal.hpp.

◆ setRange()

void CbcTreeVariable::setRange ( int value )

inline

Definition at line 286 of file CbcTreeLocal.hpp.

◆ typeCuts()

int CbcTreeVariable::typeCuts ( ) const

inline

Definition at line 291 of file CbcTreeLocal.hpp.

◆ setTypeCuts()

void CbcTreeVariable::setTypeCuts ( int value )

inline

Definition at line 296 of file CbcTreeLocal.hpp.

◆ maxDiversification()

int CbcTreeVariable::maxDiversification ( ) const

inline

Definition at line 301 of file CbcTreeLocal.hpp.

◆ setMaxDiversification()

void CbcTreeVariable::setMaxDiversification ( int value )

inline

Definition at line 306 of file CbcTreeLocal.hpp.

◆ timeLimit()

int CbcTreeVariable::timeLimit ( ) const

inline

Definition at line 311 of file CbcTreeLocal.hpp.

◆ setTimeLimit()

void CbcTreeVariable::setTimeLimit ( int value )

inline

Definition at line 316 of file CbcTreeLocal.hpp.

◆ nodeLimit()

int CbcTreeVariable::nodeLimit ( ) const

inline

Definition at line 321 of file CbcTreeLocal.hpp.

◆ setNodeLimit()

void CbcTreeVariable::setNodeLimit ( int value )

inline

Definition at line 326 of file CbcTreeLocal.hpp.

◆ refine()

bool CbcTreeVariable::refine ( ) const

inline

Definition at line 331 of file CbcTreeLocal.hpp.

◆ setRefine()

void CbcTreeVariable::setRefine ( bool yesNo )

inline

Definition at line 336 of file CbcTreeLocal.hpp.

Member Data Documentation

◆ localNode_

CbcNode* CbcTreeVariable::localNode_

private

Definition at line 344 of file CbcTreeLocal.hpp.

◆ bestSolution_

double* CbcTreeVariable::bestSolution_

private

Definition at line 346 of file CbcTreeLocal.hpp.

◆ savedSolution_

double* CbcTreeVariable::savedSolution_

private

Definition at line 348 of file CbcTreeLocal.hpp.

◆ saveNumberSolutions_

int CbcTreeVariable::saveNumberSolutions_

private

Definition at line 350 of file CbcTreeLocal.hpp.

◆ cut_

OsiRowCut CbcTreeVariable::cut_

private

Definition at line 352 of file CbcTreeLocal.hpp.

◆ fixedCut_

OsiRowCut CbcTreeVariable::fixedCut_

private

Definition at line 354 of file CbcTreeLocal.hpp.

◆ model_

CbcModel* CbcTreeVariable::model_

private

Definition at line 356 of file CbcTreeLocal.hpp.

◆ originalLower_

double* CbcTreeVariable::originalLower_

private

Definition at line 358 of file CbcTreeLocal.hpp.

◆ originalUpper_

double* CbcTreeVariable::originalUpper_

private

Definition at line 360 of file CbcTreeLocal.hpp.

◆ range_

int CbcTreeVariable::range_

private

Definition at line 362 of file CbcTreeLocal.hpp.

◆ typeCuts_

int CbcTreeVariable::typeCuts_

private

Definition at line 364 of file CbcTreeLocal.hpp.

◆ maxDiversification_

int CbcTreeVariable::maxDiversification_

private

Definition at line 366 of file CbcTreeLocal.hpp.

◆ diversification_

int CbcTreeVariable::diversification_

private

Definition at line 368 of file CbcTreeLocal.hpp.

◆ nextStrong_

bool CbcTreeVariable::nextStrong_

private

Definition at line 370 of file CbcTreeLocal.hpp.

◆ rhs_

double CbcTreeVariable::rhs_

private

Definition at line 372 of file CbcTreeLocal.hpp.

◆ savedGap_

double CbcTreeVariable::savedGap_

private

Definition at line 374 of file CbcTreeLocal.hpp.

◆ bestCutoff_

double CbcTreeVariable::bestCutoff_

private

Definition at line 376 of file CbcTreeLocal.hpp.

◆ timeLimit_

int CbcTreeVariable::timeLimit_

private

Definition at line 378 of file CbcTreeLocal.hpp.

◆ startTime_

int CbcTreeVariable::startTime_

private

Definition at line 380 of file CbcTreeLocal.hpp.

◆ nodeLimit_

int CbcTreeVariable::nodeLimit_

private

Definition at line 382 of file CbcTreeLocal.hpp.

◆ startNode_

int CbcTreeVariable::startNode_

private

Definition at line 384 of file CbcTreeLocal.hpp.

◆ searchType_

int CbcTreeVariable::searchType_

private

Definition at line 386 of file CbcTreeLocal.hpp.

◆ refine_

bool CbcTreeVariable::refine_

private

Definition at line 388 of file CbcTreeLocal.hpp.

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

/home/ted/Projects/Cbc/Cbc/src/CbcTreeLocal.hpp

Public Member Functions

Other stuff

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ CbcTreeVariable() [1/3]

◆ CbcTreeVariable() [2/3]

◆ CbcTreeVariable() [3/3]

◆ ~CbcTreeVariable()

Member Function Documentation

◆ operator=()

◆ clone()

◆ generateCpp()

◆ top()

◆ push()

◆ pop()

◆ createCut()

◆ empty()

◆ endSearch()

◆ reverseCut()

◆ deleteCut()

◆ passInSolution()

◆ range()

◆ setRange()

◆ typeCuts()

◆ setTypeCuts()

◆ maxDiversification()

◆ setMaxDiversification()

◆ timeLimit()

◆ setTimeLimit()

◆ nodeLimit()

◆ setNodeLimit()

◆ refine()

◆ setRefine()

Member Data Documentation

◆ localNode_

◆ bestSolution_

◆ savedSolution_

◆ saveNumberSolutions_

◆ cut_

◆ fixedCut_

◆ model_

◆ originalLower_

◆ originalUpper_

◆ range_

◆ typeCuts_

◆ maxDiversification_

◆ diversification_

◆ nextStrong_

◆ rhs_

◆ savedGap_

◆ bestCutoff_

◆ timeLimit_

◆ startTime_

◆ nodeLimit_

◆ startNode_

◆ searchType_

◆ refine_