This is the class in which we are finally able to concretely define the bounding procedure.
More...
|
| BlisTreeNode () |
| Default constructor.
|
|
| BlisTreeNode (BlisModel *m) |
| Useful constructor.
|
|
| BlisTreeNode (AlpsNodeDesc *&desc) |
| Useful constructor.
|
|
virtual | ~BlisTreeNode () |
| Destructor.
|
|
void | init () |
| Initilize member data when constructing a node.
|
|
AlpsTreeNode * | createNewTreeNode (AlpsNodeDesc *&desc) const |
| Create a new node based on given desc.
|
|
virtual int | installSubProblem (BcpsModel *mode) |
| intall subproblem
|
|
virtual int | process (bool isRoot=false, bool rampUp=false) |
| Performing the bounding operation.
|
|
virtual int | bound (BcpsModel *model) |
| Bounding procedure.
|
|
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.
|
|
int | selectBranchObject (BlisModel *model, bool &foundSol, int numPassesLeft) |
| Select a branching object based on give branching strategy.
|
|
virtual int | chooseBranchingObject (BcpsModel *) |
| To be defined.
|
|
int | generateConstraints (BlisModel *model, BcpsConstraintPool &conPool) |
| Generate constraints.
|
|
int | callHeuristics (BlisModel *model, bool onlyBeforeRoot=false) |
| Call heuristic to search solutions.
|
|
void | getViolatedConstraints (BlisModel *model, const double *currLpSolution, BcpsConstraintPool &conPool) |
| Get violated constraints.
|
|
BlisReturnStatus | applyConstraints (BlisModel *model, const double *solution, BcpsConstraintPool &conPool) |
| Select and apply constraints.
|
|
BlisReturnStatus | reducedCostFix (BlisModel *model) |
| Fix and tighten varaibles based optimality conditions.
|
|
virtual AlpsEncoded * | encode () const |
| Encode this node for message passing.
|
|
virtual AlpsKnowledge * | decode (AlpsEncoded &) const |
| Decode a node from an encoded object.
|
|
virtual AlpsEncoded * | encode () const |
| Return constraint pool.
|
|
virtual AlpsReturnStatus | encode (AlpsEncoded *encoded) |
| Return constraint pool.
|
|
|
virtual void | convertToExplicit () |
| Convert explicit description to difference, and vise-vesa.
|
|
virtual void | convertToRelative () |
|
| BcpsTreeNode () |
|
virtual | ~BcpsTreeNode () |
|
const BcpsBranchObject * | branchObject () const |
|
void | setBranchObject (BcpsBranchObject *b) |
|
| AlpsTreeNode () |
|
virtual | ~AlpsTreeNode () |
|
bool | operator< (const AlpsTreeNode &compNode) |
|
AlpsNodeDesc * | modifyDesc () |
|
AlpsNodeDesc * | getDesc () const |
|
void | setDesc (AlpsNodeDesc *desc) |
|
AlpsKnowledgeBroker * | getKnowledgeBroker () const |
|
void | setKnowledgeBroker (AlpsKnowledgeBroker *kb) |
|
void | removeChild (AlpsTreeNode *&child) |
|
void | addChild (AlpsTreeNode *&child) |
|
void | removeDescendants () |
|
AlpsNodeStatus | getStatus () const |
|
void | setStatus (const AlpsNodeStatus stat) |
|
bool | isCandidate () const |
|
bool | isEvaluated () const |
|
bool | isPregnant () const |
|
bool | isBranched () const |
|
bool | isFathomed () const |
|
bool | isDiscarded () const |
|
bool | isActive () const |
|
void | setActive (const bool yesno) |
|
AlpsNodeIndex_t | getIndex () const |
|
void | setIndex (const AlpsNodeIndex_t index) |
|
int | getDepth () const |
|
void | setDepth (const int depth) |
|
double | getSolEstimate () const |
|
void | setSolEstimate (double est) |
|
double | getQuality () const |
|
void | setQuality (double quality) |
|
int | getNumChildren () const |
|
void | setNumChildren (const int numChildren) |
|
void | modifyNumChildren (const int s) |
|
AlpsTreeNode * | getChild (const int i) const |
|
void | setChild (const int i, AlpsTreeNode *node) |
|
AlpsTreeNode * | getParent () const |
|
void | setParent (AlpsTreeNode *parent) |
|
AlpsNodeIndex_t | getParentIndex () const |
|
void | setParentIndex (AlpsNodeIndex_t index) |
|
int | getExplicit () const |
|
void | setExplicit (int fp) |
|
int | getSentMark () const |
|
void | setSentMark (const int tf) |
|
AlpsNodeStatus | getStatus () const |
|
void | setStatus (const AlpsNodeStatus stat) |
|
bool | isCandidate () const |
|
bool | isEvaluated () const |
|
bool | isPregnant () const |
|
bool | isBranched () const |
|
bool | isFathomed () const |
|
bool | isDiscarded () const |
|
bool | isActive () const |
|
void | setActive (const bool yesno) |
|
AlpsNodeIndex_t | getIndex () const |
|
void | setIndex (const AlpsNodeIndex_t index) |
|
int | getDepth () const |
|
void | setDepth (const int depth) |
|
double | getSolEstimate () const |
|
void | setSolEstimate (double est) |
|
double | getQuality () const |
|
void | setQuality (double quality) |
|
int | getNumChildren () const |
|
void | setNumChildren (const int numChildren) |
|
void | modifyNumChildren (const int s) |
|
AlpsTreeNode * | getChild (const int i) const |
|
void | setChild (const int i, AlpsTreeNode *node) |
|
AlpsTreeNode * | getParent () const |
|
void | setParent (AlpsTreeNode *parent) |
|
AlpsNodeIndex_t | getParentIndex () const |
|
void | setParentIndex (AlpsNodeIndex_t index) |
|
int | getExplicit () const |
|
void | setExplicit (int fp) |
|
int | getSentMark () const |
|
void | setSentMark (const int tf) |
|
| AlpsKnowledge () |
|
virtual | ~AlpsKnowledge () |
|
KnowledgeType | getType () |
|
void | setType (KnowledgeType t) |
|
AlpsEncoded * | getEncoded () const |
|
void | setEncoded (AlpsEncoded *e) |
|
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.