6 #ifndef CbcBranchDynamic_H 7 #define CbcBranchDynamic_H 9 #include "CoinPackedMatrix.hpp" 56 double changeUp,
int numInfUp,
57 double changeDn,
int numInfDn);
124 int way,
double value,
135 double lowerValue,
double upperValue);
151 int way,
double value,
Simple branching object for an integer variable.
CbcSimpleIntegerDynamicPseudoCost * object_
Pointer back to object.
virtual void setBestCriterion(double value)
Sets or gets best criterion so far.
CbcBranchDynamicDecision & operator=(const CbcBranchDynamicDecision &rhs)
Illegal Assignment operator.
Branching decision dynamic class.
double bestChangeDown_
Change down for best.
virtual ~CbcBranchDynamicDecision()
Abstract base class for ‘objects’.
Define a single integer class but with dynamic pseudo costs.
void setChangeInGuessed(double value)
Set change in guessed.
virtual void initialize(CbcModel *model)
Initialize, e.g. before the start of branch selection at a node.
virtual void saveBranchingObject(OsiBranchingObject *object)
Saves a clone of current branching object.
double changeInGuessed_
Change in guessed objective value for next branch.
virtual CbcBranchObjType type() const
Return the type (an integer identifier) of this.
virtual CbcBranchDecision * clone() const
Clone.
CbcBranchDynamicDecision()
CbcModel * model() const
Return model.
double bestChangeUp_
Change up for best.
CbcBranchingObject * bestObject_
Pointer to best branching object.
Simple branching object for an integer variable with pseudo costs.
virtual ~CbcDynamicPseudoCostBranchingObject()
Destructor.
int way() const
Get the state of the branching object.
Abstract branching object base class Now just difference with OsiBranchingObject. ...
int bestNumberDown_
Number of infeasibilities for down.
int bestNumberUp_
Number of infeasibilities for up.
double bestCriterion_
data
Information required while the node is live.
int variable() const
Index identifying the associated CbcObject within its class.
double changeInGuessed() const
Change in guessed.
virtual double branch()=0
Execute the actions required to branch, as specified by the current state of the branching object...
virtual double getBestCriterion() const
CbcSimpleIntegerDynamicPseudoCost * object() const
Return object.
virtual void updateInformation(OsiSolverInterface *solver, const CbcNode *node)
Pass in information on branch just done.
CbcDynamicPseudoCostBranchingObject & operator=(const CbcDynamicPseudoCostBranchingObject &rhs)
Assignment operator.
virtual double branch()
Sets the bounds for the variable according to the current arm of the branch and advances the object s...
CbcDynamicPseudoCostBranchingObject()
Default constructor.
virtual int whichMethod()
Says whether this method can handle both methods - 1 better, 2 best, 3 both.
virtual int betterBranch(CbcBranchingObject *thisOne, CbcBranchingObject *bestSoFar, double changeUp, int numInfUp, double changeDn, int numInfDn)
Compare two branching objects.
void setObject(CbcSimpleIntegerDynamicPseudoCost *object)
Set object.
Simple Branch and bound class.
void fillPart(int variable, int way, double value, CbcSimpleIntegerDynamicPseudoCost *object)
Does part of constructor.
virtual CbcBranchingObject * clone() const
Clone.
virtual int fillStrongInfo(CbcStrongInfo &info)
Some branchingObjects may claim to be able to skip strong branching.