Minotaur::BrVarCand Class Reference

Derived class of BrCand, it defines candidates for branching on bounds of a variable. More...

#include <BrVarCand.h>

Inheritance diagram for Minotaur::BrVarCand:

Collaboration diagram for Minotaur::BrVarCand:

Public Member Functions
	BrVarCand (VariablePtr var, int i, double d, double u)
	Constructor.
double	getDDist ()
std::string	getName () const
	Display for debugging.
double	getUDist ()
VariablePtr	getVar ()
	Get the variable that we are branching on.
void	setDist (double ddist, double udist)
Public Member Functions inherited from Minotaur::BrCand
	BrCand ()
	Constructor.
virtual	~BrCand ()
	Destroy.
virtual void	decrBranches ()
	Decrement the number of branches currently associated with this candidate.
virtual BranchDirection	getDir () const
	Get the preferred direction.
virtual HandlerPtr	getHandler ()
	Return the handler that created this candidate.
virtual int	getPCostIndex () const
	Return the index in the pseudo cost array. If it is not in the array, return a value less than 0.
virtual double	getScore ()
	Return the score for this candidate.
virtual int	numBranches ()
	Return the number of branches currently associated with this candidate.
virtual void	setDir (BranchDirection d)
	Set the preferred direction that will be processed first in the branch-and-bound tree.
void	setDist (double ddist, double udist)
	Set the distance of the current solution from the down branch and the up branch.
virtual void	setHandler (HandlerPtr h)
	Set the handler that created this candidate.
virtual void	setNumBranches (int n)
	Set the number of branches associated with this candidate.
virtual void	setScore (const double score)
	Set score for this candidate.

Additional Inherited Members
Protected Attributes inherited from Minotaur::BrCand
HandlerPtr	h_
	Handler that created this candidate.
int	branches_
	Number of branches still in the tree which were created by this candidate.
int	pCostIndex_
	Index of the this candidate in the pseudo-cost array.
BranchDirection	prefDir_
	Which is preferred for processing next? UpBranch or DownBranch?
double	score_
	Score of this candidate.

Detailed Description

Derived class of BrCand, it defines candidates for branching on bounds of a variable.

Member Function Documentation

getDDist()

double BrVarCand::getDDist ( )

virtual

Return the distance of the current point from the branching constraint: down direction. For an integer constrained variable, x, it would be .

Implements Minotaur::BrCand.

getName()

std::string BrVarCand::getName ( ) const

virtual

Display for debugging.

Reimplemented from Minotaur::BrCand.

getUDist()

double BrVarCand::getUDist ( )

virtual

Return the distance of the current point from the branching constraint: up direction For an integer constrained variable, x, it would be .

Implements Minotaur::BrCand.

---

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

• /home/amahajan/tmp/minotaur-test/src/base/BrVarCand.h
• /home/amahajan/tmp/minotaur-test/src/base/BrVarCand.cpp