|
virtual void | applyToModel (CbcModel *model, CoinWarmStartBasis *&basis, CbcCountRowCut **addCuts, int ¤tNumberCuts) const |
| Modify model according to information at node. More...
|
|
virtual int | applyBounds (int iColumn, double &lower, double &upper, int force) |
| Just apply bounds to one variable - force means overwrite by lower,upper (1=>infeasible) More...
|
|
virtual CbcNodeInfo * | buildRowBasis (CoinWarmStartBasis &basis) const |
| Builds up row basis backwards (until original model). More...
|
|
| CbcFullNodeInfo () |
|
| CbcFullNodeInfo (CbcModel *model, int numberRowsAtContinuous) |
| Constructor from continuous or satisfied. More...
|
|
| CbcFullNodeInfo (const CbcFullNodeInfo &) |
|
| ~CbcFullNodeInfo () |
|
virtual CbcNodeInfo * | clone () const |
| Clone. More...
|
|
const double * | lower () const |
| Lower bounds. More...
|
|
void | setColLower (int sequence, double value) |
| Set a bound. More...
|
|
double * | mutableLower () const |
| Mutable lower bounds. More...
|
|
const double * | upper () const |
| Upper bounds. More...
|
|
void | setColUpper (int sequence, double value) |
| Set a bound. More...
|
|
double * | mutableUpper () const |
| Mutable upper bounds. More...
|
|
virtual void | allBranchesGone () |
| Called when number branches left down to zero. More...
|
|
void | increment (int amount=1) |
| Increment number of references. More...
|
|
int | decrement (int amount=1) |
| Decrement number of references and return number left. More...
|
|
void | initializeInfo (int number) |
| Initialize reference counts. More...
|
|
int | numberBranchesLeft () const |
| Return number of branches left in object. More...
|
|
void | setNumberBranchesLeft (int value) |
| Set number of branches left in object. More...
|
|
int | numberPointingToThis () const |
| Return number of objects pointing to this. More...
|
|
void | setNumberPointingToThis (int number) |
| Set number of objects pointing to this. More...
|
|
void | incrementNumberPointingToThis () |
| Increment number of objects pointing to this. More...
|
|
int | branchedOn () |
| Say one branch taken. More...
|
|
void | throwAway () |
| Say thrown away. More...
|
|
CbcNodeInfo * | parent () const |
| Parent of this. More...
|
|
void | nullParent () |
| Set parent null. More...
|
|
void | addCuts (OsiCuts &cuts, int numberToBranch, int numberPointingToThis) |
|
void | addCuts (int numberCuts, CbcCountRowCut **cuts, int numberToBranch) |
|
void | deleteCuts (int numberToDelete, CbcCountRowCut **cuts) |
| Delete cuts (decrements counts) Slow unless cuts in same order as saved. More...
|
|
void | deleteCuts (int numberToDelete, int *which) |
|
void | deleteCut (int whichOne) |
| Really delete a cut. More...
|
|
void | decrementCuts (int change=1) |
| Decrement active cut counts. More...
|
|
void | incrementCuts (int change=1) |
| Increment active cut counts. More...
|
|
void | decrementParentCuts (CbcModel *model, int change=1) |
| Decrement all active cut counts in chain starting at parent. More...
|
|
void | incrementParentCuts (CbcModel *model, int change=1) |
| Increment all active cut counts in parent chain. More...
|
|
CbcCountRowCut ** | cuts () const |
| Array of pointers to cuts. More...
|
|
int | numberCuts () const |
| Number of row cuts (this node) More...
|
|
void | setNumberCuts (int value) |
|
void | nullOwner () |
| Set owner null. More...
|
|
const CbcNode * | owner () const |
|
CbcNode * | mutableOwner () const |
|
int | nodeNumber () const |
| The node number. More...
|
|
void | setNodeNumber (int node) |
|
void | deactivate (int mode=3) |
| Deactivate node information. More...
|
|
bool | allActivated () const |
| Say if normal. More...
|
|
bool | marked () const |
| Say if marked. More...
|
|
void | mark () |
| Mark. More...
|
|
void | unmark () |
| Unmark. More...
|
|
bool | symmetryWorked () const |
| Get symmetry value (true worked at this node) More...
|
|
void | setSymmetryWorked () |
| Say symmetry worked at this node) More...
|
|
const OsiBranchingObject * | parentBranch () const |
| Branching object for the parent. More...
|
|
void | unsetParentBasedData () |
| If we need to take off parent based data. More...
|
|
| CbcNodeInfo () |
| Default Constructor. More...
|
|
| CbcNodeInfo (const CbcNodeInfo &) |
| Copy constructor. More...
|
|
| CbcNodeInfo (CbcNodeInfo *parent, CbcNode *owner) |
| Construct with parent and owner. More...
|
|
virtual | ~CbcNodeInfo () |
| Destructor. More...
|
|
Information required to recreate the subproblem at this node.
When a subproblem is initially created, it is represented by a CbcNode object and an attached CbcNodeInfo object.
The CbcNode contains information needed while the subproblem remains live. The CbcNode is deleted when the last branch arm has been evaluated.
The CbcNodeInfo contains information required to maintain the branch-and-cut search tree structure (links and reference counts) and to recreate the subproblem for this node (basis, variable bounds, cutting planes). A CbcNodeInfo object remains in existence until all nodes have been pruned from the subtree rooted at this node.
The principle used to maintain the reference count is that the reference count is always the sum of all potential and actual children of the node. Specifically,
-
Once it's determined how the node will branch, the reference count is set to the number of potential children (i.e., the number of arms of the branch).
-
As each child is created by CbcNode::branch() (converting a potential child to the active subproblem), the reference count is decremented.
-
If the child survives and will become a node in the search tree (converting the active subproblem into an actual child), increment the reference count.
Notice that the active subproblem lives in a sort of limbo, neither a potential or an actual node in the branch-and-cut tree.
CbcNodeInfo objects come in two flavours. A CbcFullNodeInfo object contains a full record of the information required to recreate a subproblem. A CbcPartialNodeInfo object expresses this information in terms of differences from the parent.Holds complete information for recreating a subproblem.
A CbcFullNodeInfo object contains all necessary information (bounds, basis, and cuts) required to recreate a subproblem.
- Todo:
- While there's no explicit statement, the code often makes the implicit assumption that an CbcFullNodeInfo structure will appear only at the root node of the search tree. Things will break if this assumption is violated.
Definition at line 80 of file CbcFullNodeInfo.hpp.