Information required to recreate the subproblem at this node. More...
#include <CbcFullNodeInfo.hpp>
Public Member Functions | |
virtual void | applyToModel (CbcModel *model, CoinWarmStartBasis *&basis, CbcCountRowCut **addCuts, int ¤tNumberCuts) const |
Modify model according to information at node. | |
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). | |
virtual CbcNodeInfo * | buildRowBasis (CoinWarmStartBasis &basis) const |
Builds up row basis backwards (until original model). | |
CbcFullNodeInfo () | |
CbcFullNodeInfo (CbcModel *model, int numberRowsAtContinuous) | |
Constructor from continuous or satisfied. | |
CbcFullNodeInfo (const CbcFullNodeInfo &) | |
~CbcFullNodeInfo () | |
virtual CbcNodeInfo * | clone () const |
Clone. | |
const double * | lower () const |
Lower bounds. | |
const double * | upper () const |
Upper bounds. | |
virtual void | applyToModel (CbcModel *model, CoinWarmStartBasis *&basis, CbcCountRowCut **addCuts, int ¤tNumberCuts) const |
Modify model according to information at node. | |
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). | |
virtual CbcNodeInfo * | buildRowBasis (CoinWarmStartBasis &basis) const |
Builds up row basis backwards (until original model). | |
CbcFullNodeInfo () | |
CbcFullNodeInfo (CbcModel *model, int numberRowsAtContinuous) | |
Constructor from continuous or satisfied. | |
CbcFullNodeInfo (const CbcFullNodeInfo &) | |
~CbcFullNodeInfo () | |
virtual CbcNodeInfo * | clone () const |
Clone. | |
const double * | lower () const |
Lower bounds. | |
const double * | upper () const |
Upper bounds. | |
Protected Attributes | |
CoinWarmStartBasis * | basis_ |
Full basis. | |
int | numberIntegers_ |
double * | lower_ |
double * | upper_ |
Private Member Functions | |
CbcFullNodeInfo & | operator= (const CbcFullNodeInfo &rhs) |
Illegal Assignment operator. | |
CbcFullNodeInfo & | operator= (const CbcFullNodeInfo &rhs) |
Illegal Assignment operator. |
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,
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.
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,
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.
Definition at line 75 of file CbcFullNodeInfo.hpp.
CbcFullNodeInfo::CbcFullNodeInfo | ( | ) |
CbcFullNodeInfo::CbcFullNodeInfo | ( | CbcModel * | model, | |
int | numberRowsAtContinuous | |||
) |
Constructor from continuous or satisfied.
CbcFullNodeInfo::CbcFullNodeInfo | ( | const CbcFullNodeInfo & | ) |
CbcFullNodeInfo::~CbcFullNodeInfo | ( | ) |
CbcFullNodeInfo::CbcFullNodeInfo | ( | ) |
CbcFullNodeInfo::CbcFullNodeInfo | ( | CbcModel * | model, | |
int | numberRowsAtContinuous | |||
) |
Constructor from continuous or satisfied.
CbcFullNodeInfo::CbcFullNodeInfo | ( | const CbcFullNodeInfo & | ) |
CbcFullNodeInfo::~CbcFullNodeInfo | ( | ) |
virtual void CbcFullNodeInfo::applyToModel | ( | CbcModel * | model, | |
CoinWarmStartBasis *& | basis, | |||
CbcCountRowCut ** | addCuts, | |||
int & | currentNumberCuts | |||
) | const [virtual] |
Modify model according to information at node.
The routine modifies the model according to bound information at node, creates a new basis according to information at node, but with the size passed in through basis, and adds any cuts to the addCuts array.
Implements CbcNodeInfo.
virtual int CbcFullNodeInfo::applyBounds | ( | int | iColumn, | |
double & | lower, | |||
double & | upper, | |||
int | force | |||
) | [virtual] |
Just apply bounds to one variable - force means overwrite by lower,upper (1=>infeasible).
Implements CbcNodeInfo.
virtual CbcNodeInfo* CbcFullNodeInfo::buildRowBasis | ( | CoinWarmStartBasis & | basis | ) | const [virtual] |
Builds up row basis backwards (until original model).
Returns NULL or previous one to apply . Depends on Free being 0 and impossible for cuts
Implements CbcNodeInfo.
virtual CbcNodeInfo* CbcFullNodeInfo::clone | ( | ) | const [virtual] |
Clone.
Implements CbcNodeInfo.
const double* CbcFullNodeInfo::lower | ( | ) | const [inline] |
Lower bounds.
Definition at line 117 of file CbcFullNodeInfo.hpp.
const double* CbcFullNodeInfo::upper | ( | ) | const [inline] |
Upper bounds.
Definition at line 121 of file CbcFullNodeInfo.hpp.
CbcFullNodeInfo& CbcFullNodeInfo::operator= | ( | const CbcFullNodeInfo & | rhs | ) | [private] |
Illegal Assignment operator.
virtual void CbcFullNodeInfo::applyToModel | ( | CbcModel * | model, | |
CoinWarmStartBasis *& | basis, | |||
CbcCountRowCut ** | addCuts, | |||
int & | currentNumberCuts | |||
) | const [virtual] |
Modify model according to information at node.
The routine modifies the model according to bound information at node, creates a new basis according to information at node, but with the size passed in through basis, and adds any cuts to the addCuts array.
Implements CbcNodeInfo.
virtual int CbcFullNodeInfo::applyBounds | ( | int | iColumn, | |
double & | lower, | |||
double & | upper, | |||
int | force | |||
) | [virtual] |
Just apply bounds to one variable - force means overwrite by lower,upper (1=>infeasible).
Implements CbcNodeInfo.
virtual CbcNodeInfo* CbcFullNodeInfo::buildRowBasis | ( | CoinWarmStartBasis & | basis | ) | const [virtual] |
Builds up row basis backwards (until original model).
Returns NULL or previous one to apply . Depends on Free being 0 and impossible for cuts
Implements CbcNodeInfo.
virtual CbcNodeInfo* CbcFullNodeInfo::clone | ( | ) | const [virtual] |
Clone.
Implements CbcNodeInfo.
const double* CbcFullNodeInfo::lower | ( | ) | const [inline] |
Lower bounds.
Definition at line 117 of file CbcFullNodeInfo.hpp.
const double* CbcFullNodeInfo::upper | ( | ) | const [inline] |
Upper bounds.
Definition at line 121 of file CbcFullNodeInfo.hpp.
CbcFullNodeInfo& CbcFullNodeInfo::operator= | ( | const CbcFullNodeInfo & | rhs | ) | [private] |
Illegal Assignment operator.
CoinWarmStartBasis * CbcFullNodeInfo::basis_ [protected] |
Full basis.
This MUST BE A POINTER to avoid cutting extra information in derived warm start classes.
Definition at line 131 of file CbcFullNodeInfo.hpp.
int CbcFullNodeInfo::numberIntegers_ [protected] |
Definition at line 132 of file CbcFullNodeInfo.hpp.
double * CbcFullNodeInfo::lower_ [protected] |
Definition at line 134 of file CbcFullNodeInfo.hpp.
double * CbcFullNodeInfo::upper_ [protected] |
Definition at line 135 of file CbcFullNodeInfo.hpp.