#include <ClpNode.hpp>
Collaboration diagram for ClpNodeStuff:

Public Member Functions | |
Constructors, destructor | |
| ClpNodeStuff () | |
| Default constructor. | |
| virtual | ~ClpNodeStuff () |
| Destructor. | |
Copy methods (only copies ints etc, nulls arrays) | |
| ClpNodeStuff (const ClpNodeStuff &) | |
| The copy constructor. | |
| ClpNodeStuff & | operator= (const ClpNodeStuff &) |
| Operator =. | |
| void | zap (int type) |
| Zaps stuff 1 - arrays, 2 ints, 3 both. | |
Fill methods | |
| void | fillPseudoCosts (const double *down, const double *up, const int *numberDown, const int *numberUp, const int *numberDownInfeasible, const int *numberUpInfeasible, int number) |
| Fill with pseudocosts. | |
| void | update (int way, int sequence, double change, bool feasible) |
| Update pseudo costs. | |
| int | maximumNodes () const |
| Return maximum number of nodes. | |
| int | maximumSpace () const |
| Return maximum space for nodes. | |
Public Attributes | |
Data | |
| double | integerTolerance_ |
| Integer tolerance. | |
| double | integerIncrement_ |
| Integer increment. | |
| double * | downPseudo_ |
| Down pseudo costs. | |
| double * | upPseudo_ |
| Up pseudo costs. | |
| int * | numberDown_ |
| Number of times down. | |
| int * | numberUp_ |
| Number of times up. | |
| int * | numberDownInfeasible_ |
| Number of times down infeasible. | |
| int * | numberUpInfeasible_ |
| Number of times up infeasible. | |
| double * | saveCosts_ |
| Copy of costs (local). | |
| ClpNode ** | nodeInfo_ |
| Array of ClpNodes. | |
| ClpSimplex * | large_ |
| Large model if crunched. | |
| int * | whichRow_ |
| Which rows in large model. | |
| int * | whichColumn_ |
| Which columns in large model. | |
| int | nBound_ |
| Number bounds in large model. | |
| int | saveOptions_ |
| Save of specialOptions_ (local). | |
| int | solverOptions_ |
| Options to pass to solver 1 - create external reduced costs for columns 2 - create external reduced costs for rows 4 - create external row activity (columns always done) Above only done if feasible 32 - just create up to nDepth_+1 nodes 65536 - set if activated. | |
| int | maximumNodes_ |
| Maximum number of nodes to do. | |
| int | nDepth_ |
| Number deep. | |
| int | nNodes_ |
| Number nodes returned (-1 if fathom aborted). | |
| int | numberNodesExplored_ |
| Number of nodes explored. | |
| int | numberIterations_ |
| Number of iterations. | |
| int | presolveType_ |
| Type of presolve - 0 none, 1 crunch. | |
Definition at line 161 of file ClpNode.hpp.
| ClpNodeStuff::ClpNodeStuff | ( | ) |
Default constructor.
| virtual ClpNodeStuff::~ClpNodeStuff | ( | ) | [virtual] |
Destructor.
| ClpNodeStuff::ClpNodeStuff | ( | const ClpNodeStuff & | ) |
The copy constructor.
| ClpNodeStuff& ClpNodeStuff::operator= | ( | const ClpNodeStuff & | ) |
Operator =.
| void ClpNodeStuff::zap | ( | int | type | ) |
Zaps stuff 1 - arrays, 2 ints, 3 both.
| void ClpNodeStuff::fillPseudoCosts | ( | const double * | down, | |
| const double * | up, | |||
| const int * | numberDown, | |||
| const int * | numberUp, | |||
| const int * | numberDownInfeasible, | |||
| const int * | numberUpInfeasible, | |||
| int | number | |||
| ) |
Fill with pseudocosts.
| void ClpNodeStuff::update | ( | int | way, | |
| int | sequence, | |||
| double | change, | |||
| bool | feasible | |||
| ) |
Update pseudo costs.
| int ClpNodeStuff::maximumNodes | ( | ) | const |
Return maximum number of nodes.
| int ClpNodeStuff::maximumSpace | ( | ) | const |
Return maximum space for nodes.
| double* ClpNodeStuff::downPseudo_ |
| double* ClpNodeStuff::upPseudo_ |
| double* ClpNodeStuff::saveCosts_ |
Options to pass to solver 1 - create external reduced costs for columns 2 - create external reduced costs for rows 4 - create external row activity (columns always done) Above only done if feasible 32 - just create up to nDepth_+1 nodes 65536 - set if activated.
Definition at line 239 of file ClpNode.hpp.
1.4.7