#include <BonCbcNode.hpp>
Public Member Functions | |
| BonCbcPartialNodeInfo () | |
| BonCbcPartialNodeInfo (CbcModel *model, CbcNodeInfo *parent, CbcNode *owner, int numberChangedBounds, const int *variables, const double *boundChanges, const CoinWarmStartDiff *basisDiff) | |
| BonCbcPartialNodeInfo (const BonCbcPartialNodeInfo &) | |
| ~BonCbcPartialNodeInfo () | |
| virtual CbcNodeInfo * | clone () const |
| Clone. | |
| virtual void | allBranchesGone () |
| Method called when all direct sons have been explored to flush useless warm start information. | |
| int | getSequenceOfInfeasiblesSize () |
| Number of consecutive infeasible parents only recorded if node is infeasible. | |
| int | getSequenceOfUnsolvedSize () |
| Number of consecutive unsolved parents only recorded if node is infeasible. | |
Private Member Functions | |
| BonCbcPartialNodeInfo & | operator= (const Bonmin::BonCbcPartialNodeInfo &rhs) |
| Illegal Assignment operator. | |
Private Attributes | |
| int | sequenceOfInfeasiblesSize_ |
| Number of consecutive infeasible parents only recorded if node is infeasible. | |
| int | sequenceOfUnsolvedSize_ |
| Number of consecutive unsolved parents only recorded if node is infeasible. | |
A BonminCbcPartialNodeInfo object contains changes to the bounds and basis, and additional cuts, required to recreate a subproblem by modifying and augmenting the parent subproblem.
Definition at line 85 of file BonCbcNode.hpp.
| Bonmin::BonCbcPartialNodeInfo::BonCbcPartialNodeInfo | ( | ) |
| Bonmin::BonCbcPartialNodeInfo::BonCbcPartialNodeInfo | ( | CbcModel * | model, | |
| CbcNodeInfo * | parent, | |||
| CbcNode * | owner, | |||
| int | numberChangedBounds, | |||
| const int * | variables, | |||
| const double * | boundChanges, | |||
| const CoinWarmStartDiff * | basisDiff | |||
| ) |
| Bonmin::BonCbcPartialNodeInfo::BonCbcPartialNodeInfo | ( | const BonCbcPartialNodeInfo & | ) |
Definition at line 144 of file BonCbcNode.cpp.
| Bonmin::BonCbcPartialNodeInfo::~BonCbcPartialNodeInfo | ( | ) |
Definition at line 166 of file BonCbcNode.cpp.
| CbcNodeInfo * Bonmin::BonCbcPartialNodeInfo::clone | ( | ) | const [virtual] |
| void Bonmin::BonCbcPartialNodeInfo::allBranchesGone | ( | ) | [virtual] |
Method called when all direct sons have been explored to flush useless warm start information.
Definition at line 159 of file BonCbcNode.cpp.
References Bonmin::IpoptWarmStartDiff::flushPoint().
| int Bonmin::BonCbcPartialNodeInfo::getSequenceOfInfeasiblesSize | ( | ) | [inline] |
Number of consecutive infeasible parents only recorded if node is infeasible.
Definition at line 112 of file BonCbcNode.hpp.
References sequenceOfInfeasiblesSize_.
Referenced by BonCbcPartialNodeInfo(), and Bonmin::CbcNlpStrategy::status().
| int Bonmin::BonCbcPartialNodeInfo::getSequenceOfUnsolvedSize | ( | ) | [inline] |
Number of consecutive unsolved parents only recorded if node is infeasible.
Definition at line 117 of file BonCbcNode.hpp.
References sequenceOfUnsolvedSize_.
Referenced by BonCbcPartialNodeInfo(), and Bonmin::CbcNlpStrategy::status().
| BonCbcPartialNodeInfo& Bonmin::BonCbcPartialNodeInfo::operator= | ( | const Bonmin::BonCbcPartialNodeInfo & | rhs | ) | [private] |
Illegal Assignment operator.
Number of consecutive infeasible parents only recorded if node is infeasible.
Definition at line 124 of file BonCbcNode.hpp.
Referenced by BonCbcPartialNodeInfo(), and getSequenceOfInfeasiblesSize().
int Bonmin::BonCbcPartialNodeInfo::sequenceOfUnsolvedSize_ [private] |
Number of consecutive unsolved parents only recorded if node is infeasible.
Definition at line 126 of file BonCbcNode.hpp.
Referenced by BonCbcPartialNodeInfo(), and getSequenceOfUnsolvedSize().
1.4.7