Blis
0.94.0
|
This is the class in which we are finally able to concretely define the bounding procedure. More...
#include <BlisSubTree.h>
Public Member Functions | |
BlisTreeNode () | |
Default constructor. More... | |
BlisTreeNode (BlisModel *m) | |
Useful constructor. More... | |
BlisTreeNode (AlpsNodeDesc *&desc) | |
Useful constructor. More... | |
virtual | ~BlisTreeNode () |
Destructor. More... | |
void | init () |
Initilize member data when constructing a node. More... | |
AlpsTreeNode * | createNewTreeNode (AlpsNodeDesc *&desc) const |
Create a new node based on given desc. More... | |
virtual int | installSubProblem (BcpsModel *mode) |
intall subproblem More... | |
virtual int | process (bool isRoot=false, bool rampUp=false) |
Performing the bounding operation. More... | |
virtual int | bound (BcpsModel *model) |
Bounding procedure. More... | |
virtual std::vector< CoinTriple< AlpsNodeDesc *, AlpsNodeStatus, double > > | branch () |
Takes the explicit description of the current active node and creates the children's descriptions, which contain information about how the branching is to be done. More... | |
int | selectBranchObject (BlisModel *model, bool &foundSol, int numPassesLeft) |
Select a branching object based on give branching strategy. More... | |
virtual int | chooseBranchingObject (BcpsModel *) |
To be defined. More... | |
int | generateConstraints (BlisModel *model, BcpsConstraintPool &conPool) |
Generate constraints. More... | |
int | callHeuristics (BlisModel *model, bool onlyBeforeRoot=false) |
Call heuristic to search solutions. More... | |
void | getViolatedConstraints (BlisModel *model, const double *currLpSolution, BcpsConstraintPool &conPool) |
Get violated constraints. More... | |
BlisReturnStatus | applyConstraints (BlisModel *model, const double *solution, BcpsConstraintPool &conPool) |
Select and apply constraints. More... | |
BlisReturnStatus | reducedCostFix (BlisModel *model) |
Fix and tighten varaibles based optimality conditions. More... | |
virtual AlpsEncoded * | encode () const |
Encode this node for message passing. More... | |
virtual AlpsKnowledge * | decode (AlpsEncoded &) const |
Decode a node from an encoded object. More... | |
virtual void | convertToExplicit () |
Convert explicit description to difference, and vise-vesa. More... | |
virtual void | convertToRelative () |
This is the class in which we are finally able to concretely define the bounding procedure.
Here we can assume that we have an LP solver and that the objects are cuts and variables, etc.
Definition at line 33 of file BlisSubTree.h.
|
inline |
Default constructor.
Definition at line 79 of file BlisTreeNode.h.
|
inline |
Useful constructor.
Definition at line 85 of file BlisTreeNode.h.
|
inline |
Useful constructor.
Definition at line 91 of file BlisTreeNode.h.
|
inlinevirtual |
Destructor.
Definition at line 98 of file BlisTreeNode.h.
|
inline |
Initilize member data when constructing a node.
Definition at line 103 of file BlisTreeNode.h.
AlpsTreeNode* BlisTreeNode::createNewTreeNode | ( | AlpsNodeDesc *& | desc | ) | const |
Create a new node based on given desc.
|
virtual |
Convert explicit description to difference, and vise-vesa.
|
virtual |
|
virtual |
intall subproblem
|
virtual |
Performing the bounding operation.
|
virtual |
Bounding procedure.
|
virtual |
Takes the explicit description of the current active node and creates the children's descriptions, which contain information about how the branching is to be done.
The stati of the children are AlpsNodeStatusCandidate.
int BlisTreeNode::selectBranchObject | ( | BlisModel * | model, |
bool & | foundSol, | ||
int | numPassesLeft | ||
) |
Select a branching object based on give branching strategy.
|
inlinevirtual |
To be defined.
Definition at line 139 of file BlisTreeNode.h.
int BlisTreeNode::generateConstraints | ( | BlisModel * | model, |
BcpsConstraintPool & | conPool | ||
) |
Generate constraints.
int BlisTreeNode::callHeuristics | ( | BlisModel * | model, |
bool | onlyBeforeRoot = false |
||
) |
Call heuristic to search solutions.
0: no solution; 1: found solutions; 2: fathom this node. onlyBeforeRoot is for heuristics like feasibility pump.
void BlisTreeNode::getViolatedConstraints | ( | BlisModel * | model, |
const double * | currLpSolution, | ||
BcpsConstraintPool & | conPool | ||
) |
Get violated constraints.
BlisReturnStatus BlisTreeNode::applyConstraints | ( | BlisModel * | model, |
const double * | solution, | ||
BcpsConstraintPool & | conPool | ||
) |
Select and apply constraints.
BlisReturnStatus BlisTreeNode::reducedCostFix | ( | BlisModel * | model | ) |
Fix and tighten varaibles based optimality conditions.
|
virtual |
Encode this node for message passing.
|
virtual |
Decode a node from an encoded object.