DiveFractional class. More...
#include <CbcHeuristicDiveFractional.hpp>
Inheritance diagram for CbcHeuristicDiveFractional:
Public Member Functions | |
| CbcHeuristicDiveFractional () | |
| CbcHeuristicDiveFractional (CbcModel &model) | |
| CbcHeuristicDiveFractional (const CbcHeuristicDiveFractional &) | |
| ~CbcHeuristicDiveFractional () | |
| virtual CbcHeuristicDiveFractional * | clone () const |
| Clone. | |
| CbcHeuristicDiveFractional & | operator= (const CbcHeuristicDiveFractional &rhs) |
| Assignment operator. | |
| virtual void | generateCpp (FILE *fp) |
| Create C++ lines to get to current state. | |
| virtual bool | selectVariableToBranch (OsiSolverInterface *solver, const double *newSolution, int &bestColumn, int &bestRound) |
| Selects the next variable to branch on. | |
| CbcHeuristicDiveFractional () | |
| CbcHeuristicDiveFractional (CbcModel &model) | |
| CbcHeuristicDiveFractional (const CbcHeuristicDiveFractional &) | |
| ~CbcHeuristicDiveFractional () | |
| virtual CbcHeuristicDiveFractional * | clone () const |
| Clone. | |
| CbcHeuristicDiveFractional & | operator= (const CbcHeuristicDiveFractional &rhs) |
| Assignment operator. | |
| virtual void | generateCpp (FILE *fp) |
| Create C++ lines to get to current state. | |
| virtual bool | selectVariableToBranch (OsiSolverInterface *solver, const double *newSolution, int &bestColumn, int &bestRound) |
| Selects the next variable to branch on. | |
 Public Member Functions inherited from CbcHeuristicDive | |
| CbcHeuristicDive () | |
| CbcHeuristicDive (CbcModel &model) | |
| CbcHeuristicDive (const CbcHeuristicDive &) | |
| ~CbcHeuristicDive () | |
| CbcHeuristicDive & | operator= (const CbcHeuristicDive &rhs) |
| Assignment operator. | |
| void | generateCpp (FILE *fp, const char *heuristic) |
| Create C++ lines to get to current state - does work for base class. | |
| virtual void | resetModel (CbcModel *model) |
| Resets stuff if model changes. | |
| virtual void | setModel (CbcModel *model) |
| update model (This is needed if cliques update matrix etc) | |
| virtual int | solution (double &objectiveValue, double *newSolution) |
| returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets solution values if good, sets objective value (only if good) This is called after cuts have been added - so can not add cuts This does Fractional Diving | |
| virtual void | validate () |
| Validate model i.e. sets when_ to 0 if necessary (may be NULL) | |
| void | selectBinaryVariables () |
| Select candidate binary variables for fixing. | |
| void | setPercentageToFix (double value) |
| Set percentage of integer variables to fix at bounds. | |
| void | setMaxIterations (int value) |
| Set maximum number of iterations. | |
| void | setMaxSimplexIterations (int value) |
| Set maximum number of simplex iterations. | |
| void | setMaxSimplexIterationsAtRoot (int value) |
| Set maximum number of simplex iterations at root node. | |
| void | setMaxTime (double value) |
| Set maximum time allowed. | |
| virtual bool | canHeuristicRun () |
| Tests if the heuristic can run. | |
| virtual void | initializeData () |
| Initializes any data which is going to be used repeatedly in selectVariableToBranch. | |
| int | reducedCostFix (OsiSolverInterface *solver) |
| Perform reduced cost fixing on integer variables. | |
| virtual int | fixOtherVariables (OsiSolverInterface *solver, const double *solution, PseudoReducedCost *candidate, const double *random) |
| Fix other variables at bounds. | |
| CbcHeuristicDive () | |
| CbcHeuristicDive (CbcModel &model) | |
| CbcHeuristicDive (const CbcHeuristicDive &) | |
| ~CbcHeuristicDive () | |
| CbcHeuristicDive & | operator= (const CbcHeuristicDive &rhs) |
| Assignment operator. | |
| void | generateCpp (FILE *fp, const char *heuristic) |
| Create C++ lines to get to current state - does work for base class. | |
| virtual void | resetModel (CbcModel *model) |
| Resets stuff if model changes. | |
| virtual void | setModel (CbcModel *model) |
| update model (This is needed if cliques update matrix etc) | |
| virtual int | solution (double &objectiveValue, double *newSolution) |
| returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets solution values if good, sets objective value (only if good) This is called after cuts have been added - so can not add cuts This does Fractional Diving | |
| virtual void | validate () |
| Validate model i.e. sets when_ to 0 if necessary (may be NULL) | |
| void | selectBinaryVariables () |
| Select candidate binary variables for fixing. | |
| void | setPercentageToFix (double value) |
| Set percentage of integer variables to fix at bounds. | |
| void | setMaxIterations (int value) |
| Set maximum number of iterations. | |
| void | setMaxSimplexIterations (int value) |
| Set maximum number of simplex iterations. | |
| void | setMaxSimplexIterationsAtRoot (int value) |
| Set maximum number of simplex iterations at root node. | |
| void | setMaxTime (double value) |
| Set maximum time allowed. | |
| virtual bool | canHeuristicRun () |
| Tests if the heuristic can run. | |
| virtual void | initializeData () |
| Initializes any data which is going to be used repeatedly in selectVariableToBranch. | |
| int | reducedCostFix (OsiSolverInterface *solver) |
| Perform reduced cost fixing on integer variables. | |
| virtual int | fixOtherVariables (OsiSolverInterface *solver, const double *solution, PseudoReducedCost *candidate, const double *random) |
| Fix other variables at bounds. | |
| Public Member Functions inherited from CbcHeuristic | |
| CbcHeuristic () | |
| CbcHeuristic (CbcModel &model) | |
| CbcHeuristic (const CbcHeuristic &) | |
| virtual | ~CbcHeuristic () |
| CbcHeuristic & | operator= (const CbcHeuristic &rhs) |
| Assignment operator. | |
| virtual int | solution2 (double &, double *, OsiCuts &) |
| returns 0 if no solution, 1 if valid solution, -1 if just returning an estimate of best possible solution with better objective value than one passed in Sets solution values if good, sets objective value (only if nonzero code) This is called at same time as cut generators - so can add cuts Default is do nothing | |
| void | setWhen (int value) |
| Sets "when" flag - 0 off, 1 at root, 2 other than root, 3 always. | |
| int | when () const |
| Gets "when" flag - 0 off, 1 at root, 2 other than root, 3 always. | |
| void | setNumberNodes (int value) |
| Sets number of nodes in subtree (default 200) | |
| int | numberNodes () const |
| Gets number of nodes in a subtree (default 200) | |
| void | setSwitches (int value) |
| Switches (does not apply equally to all heuristics) 1 bit - stop once allowable gap on objective reached 2 bit - always do given number of passes 4 bit - weaken cutoff by 5% every 50 passes? 8 bit - if has cutoff and suminf bobbling for 20 passes then first try halving distance to best possible then try keep halving distance to known cutoff 1024 bit - stop all heuristics on max time. | |
| int | switches () const |
| Switches (does not apply equally to all heuristics) 1 bit - stop once allowable gap on objective reached 2 bit - always do given number of passes 4 bit - weaken cutoff by 5% every 50 passes? 8 bit - if has cutoff and suminf bobbling for 20 passes then first try halving distance to best possible then try keep halving distance to known cutoff 1024 bit - stop all heuristics on max time. | |
| bool | exitNow (double bestObjective) const |
| Whether to exit at once on gap. | |
| void | setFeasibilityPumpOptions (int value) |
| Sets feasibility pump options (-1 is off) | |
| int | feasibilityPumpOptions () const |
| Gets feasibility pump options (-1 is off) | |
| void | setModelOnly (CbcModel *model) |
| Just set model - do not do anything else. | |
| void | setFractionSmall (double value) |
| Sets fraction of new(rows+columns)/old(rows+columns) before doing small branch and bound (default 1.0) | |
| double | fractionSmall () const |
| Gets fraction of new(rows+columns)/old(rows+columns) before doing small branch and bound (default 1.0) | |
| int | numberSolutionsFound () const |
| Get how many solutions the heuristic thought it got. | |
| void | incrementNumberSolutionsFound () |
| Increment how many solutions the heuristic thought it got. | |
| int | smallBranchAndBound (OsiSolverInterface *solver, int numberNodes, double *newSolution, double &newSolutionValue, double cutoff, std::string name) const |
| Do mini branch and bound - return 0 not finished - no solution 1 not finished - solution 2 finished - no solution 3 finished - solution (could add global cut if finished) -1 returned on size -2 time or user event. | |
| virtual bool | canDealWithOdd () const |
| Returns true if can deal with "odd" problems e.g. sos type 2. | |
| const char * | heuristicName () const |
| return name of heuristic | |
| void | setHeuristicName (const char *name) |
| set name of heuristic | |
| void | setSeed (int value) |
| Set random number generator seed. | |
| void | setDecayFactor (double value) |
| Sets decay factor (for howOften) on failure. | |
| void | setInputSolution (const double *solution, double objValue) |
| Set input solution. | |
| void | setWhereFrom (int value) |
| void | setShallowDepth (int value) |
| Upto this depth we call the tree shallow and the heuristic can be called multiple times. | |
| void | setHowOftenShallow (int value) |
| How often to invoke the heuristics in the shallow part of the tree. | |
| void | setMinDistanceToRun (int value) |
| How "far" should this node be from every other where the heuristic was run in order to allow the heuristic to run in this node, too. | |
| virtual bool | shouldHeurRun (int whereFrom) |
| Check whether the heuristic should run at all 0 - before cuts at root node (or from doHeuristics) 1 - during cuts at root 2 - after root node cuts 3 - after cuts at other nodes 4 - during cuts at other nodes 8 added if previous heuristic in loop found solution. | |
| bool | shouldHeurRun_randomChoice () |
| Check whether the heuristic should run this time. | |
| void | debugNodes () |
| void | printDistanceToNodes () |
| int | numRuns () const |
| how many times the heuristic has actually run | |
| int | numCouldRun () const |
| How many times the heuristic could run. | |
| OsiSolverInterface * | cloneBut (int type) |
| Clone but . | |
| CbcHeuristic () | |
| CbcHeuristic (CbcModel &model) | |
| CbcHeuristic (const CbcHeuristic &) | |
| virtual | ~CbcHeuristic () |
| CbcHeuristic & | operator= (const CbcHeuristic &rhs) |
| Assignment operator. | |
| virtual int | solution2 (double &, double *, OsiCuts &) |
| returns 0 if no solution, 1 if valid solution, -1 if just returning an estimate of best possible solution with better objective value than one passed in Sets solution values if good, sets objective value (only if nonzero code) This is called at same time as cut generators - so can add cuts Default is do nothing | |
| void | setWhen (int value) |
| Sets "when" flag - 0 off, 1 at root, 2 other than root, 3 always. | |
| int | when () const |
| Gets "when" flag - 0 off, 1 at root, 2 other than root, 3 always. | |
| void | setNumberNodes (int value) |
| Sets number of nodes in subtree (default 200) | |
| int | numberNodes () const |
| Gets number of nodes in a subtree (default 200) | |
| void | setSwitches (int value) |
| Switches (does not apply equally to all heuristics) 1 bit - stop once allowable gap on objective reached 2 bit - always do given number of passes 4 bit - weaken cutoff by 5% every 50 passes? 8 bit - if has cutoff and suminf bobbling for 20 passes then first try halving distance to best possible then try keep halving distance to known cutoff 1024 bit - stop all heuristics on max time. | |
| int | switches () const |
| Switches (does not apply equally to all heuristics) 1 bit - stop once allowable gap on objective reached 2 bit - always do given number of passes 4 bit - weaken cutoff by 5% every 50 passes? 8 bit - if has cutoff and suminf bobbling for 20 passes then first try halving distance to best possible then try keep halving distance to known cutoff 1024 bit - stop all heuristics on max time. | |
| bool | exitNow (double bestObjective) const |
| Whether to exit at once on gap. | |
| void | setFeasibilityPumpOptions (int value) |
| Sets feasibility pump options (-1 is off) | |
| int | feasibilityPumpOptions () const |
| Gets feasibility pump options (-1 is off) | |
| void | setModelOnly (CbcModel *model) |
| Just set model - do not do anything else. | |
| void | setFractionSmall (double value) |
| Sets fraction of new(rows+columns)/old(rows+columns) before doing small branch and bound (default 1.0) | |
| double | fractionSmall () const |
| Gets fraction of new(rows+columns)/old(rows+columns) before doing small branch and bound (default 1.0) | |
| int | numberSolutionsFound () const |
| Get how many solutions the heuristic thought it got. | |
| void | incrementNumberSolutionsFound () |
| Increment how many solutions the heuristic thought it got. | |
| int | smallBranchAndBound (OsiSolverInterface *solver, int numberNodes, double *newSolution, double &newSolutionValue, double cutoff, std::string name) const |
| Do mini branch and bound - return 0 not finished - no solution 1 not finished - solution 2 finished - no solution 3 finished - solution (could add global cut if finished) -1 returned on size -2 time or user event. | |
| virtual bool | canDealWithOdd () const |
| Returns true if can deal with "odd" problems e.g. sos type 2. | |
| const char * | heuristicName () const |
| return name of heuristic | |
| void | setHeuristicName (const char *name) |
| set name of heuristic | |
| void | setSeed (int value) |
| Set random number generator seed. | |
| void | setDecayFactor (double value) |
| Sets decay factor (for howOften) on failure. | |
| void | setInputSolution (const double *solution, double objValue) |
| Set input solution. | |
| void | setWhereFrom (int value) |
| void | setShallowDepth (int value) |
| Upto this depth we call the tree shallow and the heuristic can be called multiple times. | |
| void | setHowOftenShallow (int value) |
| How often to invoke the heuristics in the shallow part of the tree. | |
| void | setMinDistanceToRun (int value) |
| How "far" should this node be from every other where the heuristic was run in order to allow the heuristic to run in this node, too. | |
| virtual bool | shouldHeurRun (int whereFrom) |
| Check whether the heuristic should run at all 0 - before cuts at root node (or from doHeuristics) 1 - during cuts at root 2 - after root node cuts 3 - after cuts at other nodes 4 - during cuts at other nodes 8 added if previous heuristic in loop found solution. | |
| bool | shouldHeurRun_randomChoice () |
| Check whether the heuristic should run this time. | |
| void | debugNodes () |
| void | printDistanceToNodes () |
| int | numRuns () const |
| how many times the heuristic has actually run | |
| int | numCouldRun () const |
| How many times the heuristic could run. | |
| OsiSolverInterface * | cloneBut (int type) |
| Clone but . | |
Additional Inherited Members | |
| Protected Attributes inherited from CbcHeuristicDive | |
| CoinPackedMatrix | matrix_ |
| CoinPackedMatrix | matrixByRow_ |
| unsigned short * | downLocks_ |
| unsigned short * | upLocks_ |
| double * | downArray_ |
| Extra down array (number Integers long) | |
| double * | upArray_ |
| Extra up array (number Integers long) | |
| std::vector< int > | binVarIndex_ |
| std::vector< int > | vbRowIndex_ |
| double | percentageToFix_ |
| int | maxIterations_ |
| int | maxSimplexIterations_ |
| int | maxSimplexIterationsAtRoot_ |
| double | maxTime_ |
| Protected Attributes inherited from CbcHeuristic | |
| CbcModel * | model_ |
| Model. | |
| int | when_ |
| When flag - 0 off, 1 at root, 2 other than root, 3 always. | |
| int | numberNodes_ |
| Number of nodes in any sub tree. | |
| int | feasibilityPumpOptions_ |
| Feasibility pump options (-1 is off) | |
| double | fractionSmall_ |
| Fraction of new(rows+columns)/old(rows+columns) before doing small branch and bound. | |
| CoinThreadRandom | randomNumberGenerator_ |
| Thread specific random number generator. | |
| std::string | heuristicName_ |
| Name for printing. | |
| int | howOften_ |
| How often to do (code can change) | |
| double | decayFactor_ |
| How much to increase how often. | |
| int | switches_ |
| Switches (does not apply equally to all heuristics) 1 bit - stop once allowable gap on objective reached 2 bit - always do given number of passes 4 bit - weaken cutoff by 5% every 50 passes? 8 bit - if has cutoff and suminf bobbling for 20 passes then first try halving distance to best possible then try keep halving distance to known cutoff 1024 bit - stop all heuristics on max time. | |
| int | whereFrom_ |
| int | shallowDepth_ |
| Upto this depth we call the tree shallow and the heuristic can be called multiple times. | |
| int | howOftenShallow_ |
| How often to invoke the heuristics in the shallow part of the tree. | |
| int | numInvocationsInShallow_ |
| How many invocations happened within the same node when in a shallow part of the tree. | |
| int | numInvocationsInDeep_ |
| How many invocations happened when in the deep part of the tree. | |
| int | lastRunDeep_ |
| After how many deep invocations was the heuristic run last time. | |
| int | numRuns_ |
| how many times the heuristic has actually run | |
| int | minDistanceToRun_ |
| How "far" should this node be from every other where the heuristic was run in order to allow the heuristic to run in this node, too. | |
| CbcHeuristicNodeList | runNodes_ |
| The description of the nodes where this heuristic has been applied. | |
| int | numCouldRun_ |
| How many times the heuristic could run. | |
| int | numberSolutionsFound_ |
| How many solutions the heuristic thought it got. | |
| double * | inputSolution_ |
Detailed Description
DiveFractional class.
Definition at line 12 of file CbcHeuristicDiveFractional.hpp.
Constructor & Destructor Documentation
| CbcHeuristicDiveFractional::CbcHeuristicDiveFractional | ( | ) |
| CbcHeuristicDiveFractional::CbcHeuristicDiveFractional | ( | CbcModel & | model | ) |
| CbcHeuristicDiveFractional::CbcHeuristicDiveFractional | ( | const CbcHeuristicDiveFractional & | ) |
| CbcHeuristicDiveFractional::~CbcHeuristicDiveFractional | ( | ) |
| CbcHeuristicDiveFractional::CbcHeuristicDiveFractional | ( | ) |
| CbcHeuristicDiveFractional::CbcHeuristicDiveFractional | ( | CbcModel & | model | ) |
| CbcHeuristicDiveFractional::CbcHeuristicDiveFractional | ( | const CbcHeuristicDiveFractional & | ) |
| CbcHeuristicDiveFractional::~CbcHeuristicDiveFractional | ( | ) |
Member Function Documentation
|
virtual |
Clone.
Implements CbcHeuristicDive.
| CbcHeuristicDiveFractional& CbcHeuristicDiveFractional::operator= | ( | const CbcHeuristicDiveFractional & | rhs | ) |
Assignment operator.
|
virtual |
Create C++ lines to get to current state.
Reimplemented from CbcHeuristicDive.
|
virtual |
Selects the next variable to branch on.
Returns true if all the fractional variables can be trivially rounded. Returns false, if there is at least one fractional variable that is not trivially roundable. In this case, the bestColumn returned will not be trivially roundable.
Implements CbcHeuristicDive.
|
virtual |
Clone.
Implements CbcHeuristicDive.
| CbcHeuristicDiveFractional& CbcHeuristicDiveFractional::operator= | ( | const CbcHeuristicDiveFractional & | rhs | ) |
Assignment operator.
|
virtual |
Create C++ lines to get to current state.
Reimplemented from CbcHeuristicDive.
|
virtual |
Selects the next variable to branch on.
Returns true if all the fractional variables can be trivially rounded. Returns false, if there is at least one fractional variable that is not trivially roundable. In this case, the bestColumn returned will not be trivially roundable.
Implements CbcHeuristicDive.
The documentation for this class was generated from the following files:
- /tmp/buildd/coinor-cbc-2.5.0/Cbc/src/CbcHeuristicDiveFractional.hpp
- /tmp/buildd/coinor-cbc-2.5.0/debian/tmp/usr/include/coin/CbcHeuristicDiveFractional.hpp
