Minotaur::MaxFreqBrancher Class Reference

A class to select a variable for branching using maximum-frequency branching. More...

#include <MaxFreqBrancher.h>

Inheritance diagram for Minotaur::MaxFreqBrancher:

Collaboration diagram for Minotaur::MaxFreqBrancher:

Public Member Functions
	MaxFreqBrancher (EnvPtr env, HandlerVector &handlers)
	Construct using an environment pointer and initialize .
	~MaxFreqBrancher ()
	Destroy.
Branches	findBranches (RelaxationPtr rel, NodePtr node, ConstSolutionPtr sol, SolutionPoolPtr s_pool, BrancherStatus &br_status, ModVector &mods)
	Find a branching candidate.
virtual void	updateAfterSolve (NodePtr, ConstSolutionPtr)
	Update pseudo-costs after LP is solved.
void	writeStats (std::ostream &out) const
	Write statistics to the given out stream.
std::string	getName () const
	Return the name of this brancher.
void	initialize (RelaxationPtr rel)
	Initialize data structures.
Public Member Functions inherited from Minotaur::Brancher
	Brancher ()
	Default constructor.
virtual	~Brancher ()
	Destroy.

Additional Inherited Members
Protected Attributes inherited from Minotaur::Brancher
LoggerPtr	logger_
	Log manager.

Detailed Description

A class to select a variable for branching using maximum-frequency branching.

Member Function Documentation

findBranches()

Branches MaxFreqBrancher::findBranches ( RelaxationPtr  rel, NodePtr  node, ConstSolutionPtr  sol, SolutionPoolPtr  s_pool, BrancherStatus &  br_status, ModVector &  mods  )

virtual

Find a branching candidate.

Returns

NULL if x does not have any fractional values for integer constrained variables or if no branching candidates are found (e.g. when we realize that problem is infeasible).

Parameters

[in]	rel	Relaxation at the current node.
[in]	node	The current node.
[in]	sol	The solution at the current node.
[in]	s_pool	Solution pool containing known feasible solutions.
[out]	br_status	Status returned by this brancher.
[out]	mods	Modification returned by this brancher. NULL if none found.

Implements Minotaur::Brancher.

getName()

std::string MaxFreqBrancher::getName ( ) const

virtual

Return the name of this brancher.

Implements Minotaur::Brancher.

initialize()

void MaxFreqBrancher::initialize

(

RelaxationPtr

rel

)

Initialize data structures.

Parameters

[in]

rel

Relaxation for which this brancher is used.

updateAfterSolve()

void MaxFreqBrancher::updateAfterSolve ( NodePtr  node, ConstSolutionPtr  sol  )

virtual

Update pseudo-costs after LP is solved.

Parameters

[in]	node	The node for which relaxation is solved. The pseudo cost of branching candidate used in node->parent is updated.
[in]	sol	The solution of the relaxation at this node (not the parent).

Reimplemented from Minotaur::Brancher.

writeStats()

void MaxFreqBrancher::writeStats ( std::ostream &  ) const

virtual

Write statistics to the given out stream.

Reimplemented from Minotaur::Brancher.

---

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

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