|
| BcpsSubTree () |
|
virtual | ~BcpsSubTree () |
|
BcpsConstraintPool * | getConstraintPool () const |
|
BcpsVariablePool * | getVariablePool () const |
|
| AlpsSubTree () |
|
| AlpsSubTree (AlpsKnowledgeBroker *kb) |
|
virtual | ~AlpsSubTree () |
|
AlpsTreeNode * | activeNode () |
|
void | setActiveNode (AlpsTreeNode *activeNode) |
|
void | createChildren (AlpsTreeNode *parent, std::vector< CoinTriple< AlpsNodeDesc *, AlpsNodeStatus, double > > &children, AlpsNodePool *kidNodePool=NULL) |
|
AlpsTreeNode * | getRoot () const |
|
void | setRoot (AlpsTreeNode *r) |
|
AlpsNodePool * | nodePool () |
|
AlpsNodePool * | diveNodePool () |
|
void | setNodePool (AlpsNodePool *np) |
|
void | changeNodePool (AlpsNodePool *np) |
|
double | getBestKnowledgeValue () const |
|
AlpsTreeNode * | getBestNode () const |
|
AlpsKnowledgeBroker * | getKnowledgeBroker () const |
|
void | setKnowledgeBroker (AlpsKnowledgeBroker *kb) |
|
double | getQuality () const |
|
double | getSolEstimate () const |
|
double | calculateQuality () |
|
int | nextIndex () |
|
int | getNextIndex () const |
|
void | setNextIndex (int next) |
|
int | getNumNodes () const |
|
void | setNodeSelection (AlpsSearchStrategy< AlpsTreeNode * > *nc) |
|
AlpsSubTree * | splitSubTree (int &returnSize, int size=10) |
|
virtual AlpsReturnStatus | exploreSubTree (AlpsTreeNode *root, int nodeLimit, double timeLimit, int &numNodesProcessed, int &numNodesBranched, int &numNodesDiscarded, int &numNodesPartial, int &depth) |
|
AlpsReturnStatus | exploreUnitWork (bool leaveAsIt, int unitWork, double unitTime, AlpsExitStatus &solStatus, int &numNodesProcessed, int &numNodesBranched, int &numNodesDiscarded, int &numNodesPartial, int &depth, bool &betterSolution) |
|
virtual int | rampUp (int minNumNodes, int requiredNumNodes, int &depth, AlpsTreeNode *root=NULL) |
|
virtual AlpsEncoded * | encode () const |
|
virtual AlpsKnowledge * | decode (AlpsEncoded &encoded) const |
|
virtual AlpsSubTree * | newSubTree () const |
|
void | clearNodePools () |
|
void | nullRootActiveNode () |
|
bool | doDive () |
|
void | reset () |
|
virtual AlpsEncoded * | encode () const |
|
virtual AlpsReturnStatus | encode (AlpsEncoded *encoded) |
|
AlpsTreeNode * | getRoot () const |
|
void | setRoot (AlpsTreeNode *r) |
|
AlpsNodePool * | nodePool () |
|
AlpsNodePool * | diveNodePool () |
|
void | setNodePool (AlpsNodePool *np) |
|
void | changeNodePool (AlpsNodePool *np) |
|
double | getBestKnowledgeValue () const |
|
AlpsTreeNode * | getBestNode () const |
|
AlpsKnowledgeBroker * | getKnowledgeBroker () const |
|
void | setKnowledgeBroker (AlpsKnowledgeBroker *kb) |
|
double | getQuality () const |
|
double | getSolEstimate () const |
|
double | calculateQuality () |
|
int | nextIndex () |
|
int | getNextIndex () const |
|
void | setNextIndex (int next) |
|
int | getNumNodes () const |
|
void | setNodeSelection (AlpsSearchStrategy< AlpsTreeNode * > *nc) |
|
AlpsSubTree * | splitSubTree (int &returnSize, int size=10) |
|
virtual AlpsReturnStatus | exploreSubTree (AlpsTreeNode *root, int nodeLimit, double timeLimit, int &numNodesProcessed, int &numNodesBranched, int &numNodesDiscarded, int &numNodesPartial, int &depth) |
|
AlpsReturnStatus | exploreUnitWork (bool leaveAsIt, int unitWork, double unitTime, AlpsExitStatus &solStatus, int &numNodesProcessed, int &numNodesBranched, int &numNodesDiscarded, int &numNodesPartial, int &depth, bool &betterSolution) |
|
virtual int | rampUp (int minNumNodes, int requiredNumNodes, int &depth, AlpsTreeNode *root=NULL) |
|
virtual AlpsEncoded * | encode () const |
|
virtual AlpsKnowledge * | decode (AlpsEncoded &encoded) const |
|
virtual AlpsSubTree * | newSubTree () const |
|
void | clearNodePools () |
|
void | nullRootActiveNode () |
|
bool | doDive () |
|
void | reset () |
|
virtual AlpsEncoded * | encode () const |
|
virtual AlpsReturnStatus | encode (AlpsEncoded *encoded) |
|
| AlpsKnowledge () |
|
virtual | ~AlpsKnowledge () |
|
KnowledgeType | getType () |
|
void | setType (KnowledgeType t) |
|
virtual AlpsEncoded * | encode () const |
|
virtual AlpsReturnStatus | encode (AlpsEncoded *encoded) |
|
virtual AlpsKnowledge * | decode (AlpsEncoded &encoded) const |
|
AlpsEncoded * | getEncoded () const |
|
void | setEncoded (AlpsEncoded *e) |
|
This class is the data structure for storing a subtree within BCPS.
The biggest addition to the fields that already exist withink ALPS is the storage for the global list of objects that are active within that subtree. Initally, this will be implemeted as a std::set, but later on should be changed to something more efficient such as a hash table or something like that.
Definition at line 42 of file BcpsSubTree.h.