13 #ifndef BcpsDecompTreeNode_h_
14 #define BcpsDecompTreeNode_h_
21 #include "BcpsTreeNode.h"
91 int bound(BcpsModel * model);
95 int process(
bool isRoot,
bool rampUp);
101 std::vector< CoinTriple<AlpsNodeDesc*, AlpsNodeStatus, double> >
branch();
std::vector< CoinTriple< AlpsNodeDesc *, AlpsNodeStatus, double > > branch()
Takes the explicit description of the current active node and creates the children's descriptions...
int installSubProblem(BcpsModel *model)
intall subproblem
int chooseBranchingObject(BcpsModel *model)
To be defined.
BcpsDecompTreeNode()
Default constructor.
int bound(BcpsModel *model)
Bounding procedure.
virtual ~BcpsDecompTreeNode()
Destructor.
This class holds one node of the search tree.
AlpsTreeNode * createNewTreeNode(AlpsNodeDesc *&desc) const
Create a new node based on given desc.
int process(bool isRoot, bool rampUp)
Performing the bounding operation.
BcpsDecompTreeNode & operator=(const BcpsDecompTreeNode &)
static const char * m_classTag
class tag for debugging
A class to refer to the description of a search tree node.