This class chooses a variable to branch on. More...
#include <CbcLinked.hpp>
Public Member Functions | |
OsiChooseStrongSubset () | |
Default Constructor. | |
OsiChooseStrongSubset (const OsiSolverInterface *solver) | |
Constructor from solver (so we can set up arrays etc). | |
OsiChooseStrongSubset (const OsiChooseStrongSubset &) | |
Copy constructor. | |
OsiChooseStrongSubset & | operator= (const OsiChooseStrongSubset &rhs) |
Assignment operator. | |
virtual OsiChooseVariable * | clone () const |
Clone. | |
virtual | ~OsiChooseStrongSubset () |
Destructor. | |
virtual int | setupList (OsiBranchingInformation *info, bool initialize) |
Sets up strong list and clears all if initialize is true. | |
virtual int | chooseVariable (OsiSolverInterface *solver, OsiBranchingInformation *info, bool fixVariables) |
Choose a variable Returns - -1 Node is infeasible 0 Normal termination - we have a candidate 1 All looks satisfied - no candidate 2 We can change the bound on a variable - but we also have a strong branching candidate 3 We can change the bound on a variable - but we have a non-strong branching candidate 4 We can change the bound on a variable - no other candidates We can pick up branch from bestObjectIndex() and bestWhichWay() We can pick up a forced branch (can change bound) from firstForcedObjectIndex() and firstForcedWhichWay() If we have a solution then we can pick up from goodObjectiveValue() and goodSolution() If fixVariables is true then 2,3,4 are all really same as problem changed. | |
int | numberObjectsToUse () const |
Number of objects to use. | |
void | setNumberObjectsToUse (int value) |
Set number of objects to use. | |
OsiChooseStrongSubset () | |
Default Constructor. | |
OsiChooseStrongSubset (const OsiSolverInterface *solver) | |
Constructor from solver (so we can set up arrays etc). | |
OsiChooseStrongSubset (const OsiChooseStrongSubset &) | |
Copy constructor. | |
OsiChooseStrongSubset & | operator= (const OsiChooseStrongSubset &rhs) |
Assignment operator. | |
virtual OsiChooseVariable * | clone () const |
Clone. | |
virtual | ~OsiChooseStrongSubset () |
Destructor. | |
virtual int | setupList (OsiBranchingInformation *info, bool initialize) |
Sets up strong list and clears all if initialize is true. | |
virtual int | chooseVariable (OsiSolverInterface *solver, OsiBranchingInformation *info, bool fixVariables) |
Choose a variable Returns - -1 Node is infeasible 0 Normal termination - we have a candidate 1 All looks satisfied - no candidate 2 We can change the bound on a variable - but we also have a strong branching candidate 3 We can change the bound on a variable - but we have a non-strong branching candidate 4 We can change the bound on a variable - no other candidates We can pick up branch from bestObjectIndex() and bestWhichWay() We can pick up a forced branch (can change bound) from firstForcedObjectIndex() and firstForcedWhichWay() If we have a solution then we can pick up from goodObjectiveValue() and goodSolution() If fixVariables is true then 2,3,4 are all really same as problem changed. | |
int | numberObjectsToUse () const |
Number of objects to use. | |
void | setNumberObjectsToUse (int value) |
Set number of objects to use. | |
Protected Attributes | |
int | numberObjectsToUse_ |
Number of objects to be used (and set in solver). |
This class chooses a variable to branch on.
This is just as OsiChooseStrong but it fakes it so only first so many are looked at in this phase
Definition at line 1201 of file CbcLinked.hpp.
OsiChooseStrongSubset::OsiChooseStrongSubset | ( | ) |
Default Constructor.
OsiChooseStrongSubset::OsiChooseStrongSubset | ( | const OsiSolverInterface * | solver | ) |
Constructor from solver (so we can set up arrays etc).
OsiChooseStrongSubset::OsiChooseStrongSubset | ( | const OsiChooseStrongSubset & | ) |
Copy constructor.
virtual OsiChooseStrongSubset::~OsiChooseStrongSubset | ( | ) | [virtual] |
Destructor.
OsiChooseStrongSubset::OsiChooseStrongSubset | ( | ) |
Default Constructor.
OsiChooseStrongSubset::OsiChooseStrongSubset | ( | const OsiSolverInterface * | solver | ) |
Constructor from solver (so we can set up arrays etc).
OsiChooseStrongSubset::OsiChooseStrongSubset | ( | const OsiChooseStrongSubset & | ) |
Copy constructor.
virtual OsiChooseStrongSubset::~OsiChooseStrongSubset | ( | ) | [virtual] |
Destructor.
OsiChooseStrongSubset& OsiChooseStrongSubset::operator= | ( | const OsiChooseStrongSubset & | rhs | ) |
Assignment operator.
virtual OsiChooseVariable* OsiChooseStrongSubset::clone | ( | ) | const [virtual] |
Clone.
virtual int OsiChooseStrongSubset::setupList | ( | OsiBranchingInformation * | info, | |
bool | initialize | |||
) | [virtual] |
Sets up strong list and clears all if initialize is true.
Returns number of infeasibilities. If returns -1 then has worked out node is infeasible!
virtual int OsiChooseStrongSubset::chooseVariable | ( | OsiSolverInterface * | solver, | |
OsiBranchingInformation * | info, | |||
bool | fixVariables | |||
) | [virtual] |
Choose a variable Returns - -1 Node is infeasible 0 Normal termination - we have a candidate 1 All looks satisfied - no candidate 2 We can change the bound on a variable - but we also have a strong branching candidate 3 We can change the bound on a variable - but we have a non-strong branching candidate 4 We can change the bound on a variable - no other candidates We can pick up branch from bestObjectIndex() and bestWhichWay() We can pick up a forced branch (can change bound) from firstForcedObjectIndex() and firstForcedWhichWay() If we have a solution then we can pick up from goodObjectiveValue() and goodSolution() If fixVariables is true then 2,3,4 are all really same as problem changed.
int OsiChooseStrongSubset::numberObjectsToUse | ( | ) | const [inline] |
Number of objects to use.
Definition at line 1244 of file CbcLinked.hpp.
void OsiChooseStrongSubset::setNumberObjectsToUse | ( | int | value | ) | [inline] |
Set number of objects to use.
Definition at line 1248 of file CbcLinked.hpp.
OsiChooseStrongSubset& OsiChooseStrongSubset::operator= | ( | const OsiChooseStrongSubset & | rhs | ) |
Assignment operator.
virtual OsiChooseVariable* OsiChooseStrongSubset::clone | ( | ) | const [virtual] |
Clone.
virtual int OsiChooseStrongSubset::setupList | ( | OsiBranchingInformation * | info, | |
bool | initialize | |||
) | [virtual] |
Sets up strong list and clears all if initialize is true.
Returns number of infeasibilities. If returns -1 then has worked out node is infeasible!
virtual int OsiChooseStrongSubset::chooseVariable | ( | OsiSolverInterface * | solver, | |
OsiBranchingInformation * | info, | |||
bool | fixVariables | |||
) | [virtual] |
Choose a variable Returns - -1 Node is infeasible 0 Normal termination - we have a candidate 1 All looks satisfied - no candidate 2 We can change the bound on a variable - but we also have a strong branching candidate 3 We can change the bound on a variable - but we have a non-strong branching candidate 4 We can change the bound on a variable - no other candidates We can pick up branch from bestObjectIndex() and bestWhichWay() We can pick up a forced branch (can change bound) from firstForcedObjectIndex() and firstForcedWhichWay() If we have a solution then we can pick up from goodObjectiveValue() and goodSolution() If fixVariables is true then 2,3,4 are all really same as problem changed.
int OsiChooseStrongSubset::numberObjectsToUse | ( | ) | const [inline] |
Number of objects to use.
Definition at line 1244 of file CbcLinked.hpp.
void OsiChooseStrongSubset::setNumberObjectsToUse | ( | int | value | ) | [inline] |
Set number of objects to use.
Definition at line 1248 of file CbcLinked.hpp.
int OsiChooseStrongSubset::numberObjectsToUse_ [protected] |
Number of objects to be used (and set in solver).
Definition at line 1255 of file CbcLinked.hpp.