Cbc
2.10.10
|
Define a single integer class but with dynamic pseudo costs. More...
#include <CbcSimpleIntegerDynamicPseudoCost.hpp>
Public Member Functions | |
CbcSimpleIntegerDynamicPseudoCost () | |
CbcSimpleIntegerDynamicPseudoCost (CbcModel *model, int iColumn, double breakEven=0.5) | |
CbcSimpleIntegerDynamicPseudoCost (CbcModel *model, int iColumn, double downDynamicPseudoCost, double upDynamicPseudoCost) | |
CbcSimpleIntegerDynamicPseudoCost (CbcModel *model, int dummy, int iColumn, double downDynamicPseudoCost, double upDynamicPseudoCost) | |
CbcSimpleIntegerDynamicPseudoCost (const CbcSimpleIntegerDynamicPseudoCost &) | |
virtual CbcObject * | clone () const |
Clone. More... | |
CbcSimpleIntegerDynamicPseudoCost & | operator= (const CbcSimpleIntegerDynamicPseudoCost &rhs) |
virtual | ~CbcSimpleIntegerDynamicPseudoCost () |
virtual double | infeasibility (const OsiBranchingInformation *info, int &preferredWay) const |
Infeasibility - large is 0.5. More... | |
virtual CbcBranchingObject * | createCbcBranch (OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) |
Creates a branching object. More... | |
virtual CbcObjectUpdateData | createUpdateInformation (const OsiSolverInterface *solver, const CbcNode *node, const CbcBranchingObject *branchingObject) |
Fills in a created branching object. More... | |
virtual void | updateInformation (const CbcObjectUpdateData &data) |
Update object by CbcObjectUpdateData. More... | |
void | copySome (const CbcSimpleIntegerDynamicPseudoCost *otherObject) |
Copy some information i.e. just variable stuff. More... | |
virtual void | updateBefore (const OsiObject *rhs) |
Updates stuff like pseudocosts before threads. More... | |
virtual void | updateAfter (const OsiObject *rhs, const OsiObject *baseObject) |
Updates stuff like pseudocosts after threads finished. More... | |
void | updateAfterMini (int numberDown, int numberDownInfeasible, double sumDown, int numberUp, int numberUpInfeasible, double sumUp) |
Updates stuff like pseudocosts after mini branch and bound. More... | |
virtual OsiSolverBranch * | solverBranch () const |
Create an OsiSolverBranch object. More... | |
double | downDynamicPseudoCost () const |
Down pseudo cost. More... | |
void | setDownDynamicPseudoCost (double value) |
Set down pseudo cost. More... | |
void | updateDownDynamicPseudoCost (double value) |
Modify down pseudo cost in a slightly different way. More... | |
double | upDynamicPseudoCost () const |
Up pseudo cost. More... | |
void | setUpDynamicPseudoCost (double value) |
Set up pseudo cost. More... | |
void | updateUpDynamicPseudoCost (double value) |
Modify up pseudo cost in a slightly different way. More... | |
double | downShadowPrice () const |
Down pseudo shadow price cost. More... | |
void | setDownShadowPrice (double value) |
Set down pseudo shadow price cost. More... | |
double | upShadowPrice () const |
Up pseudo shadow price cost. More... | |
void | setUpShadowPrice (double value) |
Set up pseudo shadow price cost. More... | |
double | upDownSeparator () const |
Up down separator. More... | |
void | setUpDownSeparator (double value) |
Set up down separator. More... | |
double | sumDownCost () const |
Down sum cost. More... | |
void | setSumDownCost (double value) |
Set down sum cost. More... | |
void | addToSumDownCost (double value) |
Add to down sum cost and set last and square. More... | |
double | sumUpCost () const |
Up sum cost. More... | |
void | setSumUpCost (double value) |
Set up sum cost. More... | |
void | addToSumUpCost (double value) |
Add to up sum cost and set last and square. More... | |
double | sumDownChange () const |
Down sum change. More... | |
void | setSumDownChange (double value) |
Set down sum change. More... | |
void | addToSumDownChange (double value) |
Add to down sum change. More... | |
double | sumUpChange () const |
Up sum change. More... | |
void | setSumUpChange (double value) |
Set up sum change. More... | |
void | addToSumUpChange (double value) |
Add to up sum change and set last and square. More... | |
double | sumDownDecrease () const |
Sum down decrease number infeasibilities from strong or actual. More... | |
void | setSumDownDecrease (double value) |
Set sum down decrease number infeasibilities from strong or actual. More... | |
void | addToSumDownDecrease (double value) |
Add to sum down decrease number infeasibilities from strong or actual. More... | |
double | sumUpDecrease () const |
Sum up decrease number infeasibilities from strong or actual. More... | |
void | setSumUpDecrease (double value) |
Set sum up decrease number infeasibilities from strong or actual. More... | |
void | addToSumUpDecrease (double value) |
Add to sum up decrease number infeasibilities from strong or actual. More... | |
int | numberTimesDown () const |
Down number times. More... | |
void | setNumberTimesDown (int value) |
Set down number times. More... | |
void | incrementNumberTimesDown () |
Increment down number times. More... | |
int | numberTimesUp () const |
Up number times. More... | |
void | setNumberTimesUp (int value) |
Set up number times. More... | |
void | incrementNumberTimesUp () |
Increment up number times. More... | |
int | numberTimesBranched () const |
Number times branched. More... | |
int | numberTimesDownInfeasible () const |
Down number times infeasible. More... | |
void | setNumberTimesDownInfeasible (int value) |
Set down number times infeasible. More... | |
void | incrementNumberTimesDownInfeasible () |
Increment down number times infeasible. More... | |
int | numberTimesUpInfeasible () const |
Up number times infeasible. More... | |
void | setNumberTimesUpInfeasible (int value) |
Set up number times infeasible. More... | |
void | incrementNumberTimesUpInfeasible () |
Increment up number times infeasible. More... | |
int | numberBeforeTrust () const |
Number of times before trusted. More... | |
void | setNumberBeforeTrust (int value) |
Set number of times before trusted. More... | |
void | incrementNumberBeforeTrust () |
Increment number of times before trusted. More... | |
virtual double | upEstimate () const |
Return "up" estimate. More... | |
virtual double | downEstimate () const |
Return "down" estimate (default 1.0e-5) More... | |
int | method () const |
method - see below for details More... | |
void | setMethod (int value) |
Set method. More... | |
void | setDownInformation (double changeObjectiveDown, int changeInfeasibilityDown) |
Pass in information on a down branch. More... | |
void | setUpInformation (double changeObjectiveUp, int changeInfeasibilityUp) |
Pass in information on a up branch. More... | |
void | setProbingInformation (int fixedDown, int fixedUp) |
Pass in probing information. More... | |
void | print (int type=0, double value=0.0) const |
Print - 0 -summary, 1 just before strong. More... | |
bool | same (const CbcSimpleIntegerDynamicPseudoCost *obj) const |
Same - returns true if contents match(ish) More... | |
virtual OsiSolverBranch * | solverBranch (OsiSolverInterface *solver, const OsiBranchingInformation *info) const |
Create an OsiSolverBranch object. More... | |
virtual OsiSolverBranch * | solverBranch () const |
Create an OsiSolverBranch object. More... | |
![]() | |
CbcSimpleInteger () | |
CbcSimpleInteger (CbcModel *model, int iColumn, double breakEven=0.5) | |
CbcSimpleInteger (CbcModel *model, const OsiSimpleInteger *object) | |
CbcSimpleInteger (const CbcSimpleInteger &) | |
CbcSimpleInteger & | operator= (const CbcSimpleInteger &rhs) |
virtual | ~CbcSimpleInteger () |
OsiSimpleInteger * | osiObject () const |
Construct an OsiSimpleInteger object. More... | |
virtual double | feasibleRegion (OsiSolverInterface *solver, const OsiBranchingInformation *info) const |
Set bounds to fix the variable at the current (integer) value. More... | |
void | fillCreateBranch (CbcIntegerBranchingObject *branching, const OsiBranchingInformation *info, int way) |
Fills in a created branching object. More... | |
virtual OsiSolverBranch * | solverBranch (OsiSolverInterface *solver, const OsiBranchingInformation *info) const |
Create an OsiSolverBranch object. More... | |
virtual void | feasibleRegion () |
Set bounds to fix the variable at the current (integer) value. More... | |
virtual int | columnNumber () const |
Column number if single column object -1 otherwise, so returns >= 0 Used by heuristics. More... | |
void | setColumnNumber (int value) |
Set column number. More... | |
virtual void | resetBounds (const OsiSolverInterface *solver) |
Reset variable bounds to their original values. More... | |
virtual void | resetSequenceEtc (int numberColumns, const int *originalColumns) |
Change column numbers after preprocessing. More... | |
double | originalLowerBound () const |
Original bounds. More... | |
void | setOriginalLowerBound (double value) |
double | originalUpperBound () const |
void | setOriginalUpperBound (double value) |
double | breakEven () const |
Breakeven e.g 0.7 -> >= 0.7 go up first. More... | |
void | setBreakEven (double value) |
Set breakeven e.g 0.7 -> >= 0.7 go up first. More... | |
virtual void | feasibleRegion ()=0 |
For the variable(s) referenced by the object, look at the current solution and set bounds to match the solution. More... | |
virtual double | feasibleRegion (OsiSolverInterface *solver, const OsiBranchingInformation *info) const |
Dummy one for compatibility. More... | |
virtual double | feasibleRegion (OsiSolverInterface *solver) const |
For the variable(s) referenced by the object, look at the current solution and set bounds to match the solution. More... | |
virtual OsiSolverBranch * | solverBranch () const |
Create an OsiSolverBranch object. More... | |
![]() | |
CbcObject () | |
CbcObject (CbcModel *model) | |
CbcObject (const CbcObject &) | |
CbcObject & | operator= (const CbcObject &rhs) |
virtual | ~CbcObject () |
Destructor. More... | |
virtual double | infeasibility (int &) const |
virtual double | feasibleRegion (OsiSolverInterface *solver) const |
For the variable(s) referenced by the object, look at the current solution and set bounds to match the solution. More... | |
virtual OsiBranchingObject * | createBranch (OsiSolverInterface *, const OsiBranchingInformation *, int) const |
virtual OsiBranchingObject * | createOsiBranch (OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const |
Create an Osibranching object and indicate which way to branch first. More... | |
virtual CbcBranchingObject * | preferredNewFeasible () const |
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in a good direction. More... | |
virtual CbcBranchingObject * | notPreferredNewFeasible () const |
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in a bad direction. More... | |
virtual void | floorCeiling (double &floorValue, double &ceilingValue, double value, double tolerance) const |
Returns floor and ceiling i.e. More... | |
int | id () const |
Identifier (normally column number in matrix) More... | |
void | setId (int value) |
Set identifier (normally column number in matrix) but 1000000000 to 1100000000 means optional branching object i.e. More... | |
bool | optionalObject () const |
Return true if optional branching object i.e. More... | |
int | position () const |
Get position in object_ list. More... | |
void | setPosition (int position) |
Set position in object_ list. More... | |
void | setModel (CbcModel *model) |
update model More... | |
CbcModel * | model () const |
Return model. More... | |
int | preferredWay () const |
If -1 down always chosen first, +1 up always, 0 normal. More... | |
void | setPreferredWay (int value) |
Set -1 down always chosen first, +1 up always, 0 normal. More... | |
virtual void | redoSequenceEtc (CbcModel *, int, const int *) |
Redoes data when sequence numbers change. More... | |
virtual void | initializeForBranching (CbcModel *) |
Initialize for branching. More... | |
Protected Attributes | |
double | downDynamicPseudoCost_ |
data More... | |
double | upDynamicPseudoCost_ |
Up pseudo cost. More... | |
double | upDownSeparator_ |
Up/down separator If >0.0 then do first branch up if value-floor(value) >= this value. More... | |
double | sumDownCost_ |
Sum down cost from strong or actual. More... | |
double | sumUpCost_ |
Sum up cost from strong or actual. More... | |
double | sumDownChange_ |
Sum of all changes to x when going down. More... | |
double | sumUpChange_ |
Sum of all changes to x when going up. More... | |
double | downShadowPrice_ |
Current pseudo-shadow price estimate down. More... | |
double | upShadowPrice_ |
Current pseudo-shadow price estimate up. More... | |
double | sumDownDecrease_ |
Sum down decrease number infeasibilities from strong or actual. More... | |
double | sumUpDecrease_ |
Sum up decrease number infeasibilities from strong or actual. More... | |
double | lastDownCost_ |
Last down cost from strong (i.e. as computed by last strong) More... | |
double | lastUpCost_ |
Last up cost from strong (i.e. as computed by last strong) More... | |
int | lastDownDecrease_ |
Last down decrease number infeasibilities from strong (i.e. as computed by last strong) More... | |
int | lastUpDecrease_ |
Last up decrease number infeasibilities from strong (i.e. as computed by last strong) More... | |
int | numberTimesDown_ |
Number of times we have gone down. More... | |
int | numberTimesUp_ |
Number of times we have gone up. More... | |
int | numberTimesDownInfeasible_ |
Number of times we have been infeasible going down. More... | |
int | numberTimesUpInfeasible_ |
Number of times we have been infeasible going up. More... | |
int | numberBeforeTrust_ |
Number of branches before we trust. More... | |
int | numberTimesDownLocalFixed_ |
Number of local probing fixings going down. More... | |
int | numberTimesUpLocalFixed_ |
Number of local probing fixings going up. More... | |
double | numberTimesDownTotalFixed_ |
Number of total probing fixings going down. More... | |
double | numberTimesUpTotalFixed_ |
Number of total probing fixings going up. More... | |
int | numberTimesProbingTotal_ |
Number of times probing done. More... | |
int | method_ |
Number of times infeasible when tested. More... | |
![]() | |
double | originalLower_ |
data More... | |
double | originalUpper_ |
Original upper bound. More... | |
double | breakEven_ |
Breakeven i.e. >= this preferred is up. More... | |
int | columnNumber_ |
Column number in model. More... | |
int | preferredWay_ |
If -1 down always chosen first, +1 up always, 0 normal. More... | |
![]() | |
CbcModel * | model_ |
data More... | |
int | id_ |
Identifier (normally column number in matrix) More... | |
int | position_ |
Position in object list. More... | |
int | preferredWay_ |
If -1 down always chosen first, +1 up always, 0 normal. More... | |
Define a single integer class but with dynamic pseudo costs.
Based on work by Achterberg, Koch and Martin.
It is wild overkill but to keep design all twiddly things are in each. This could be used for fine tuning.
Definition at line 33 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
CbcSimpleIntegerDynamicPseudoCost::CbcSimpleIntegerDynamicPseudoCost | ( | ) |
CbcSimpleIntegerDynamicPseudoCost::CbcSimpleIntegerDynamicPseudoCost | ( | CbcModel * | model, |
int | iColumn, | ||
double | breakEven = 0.5 |
||
) |
CbcSimpleIntegerDynamicPseudoCost::CbcSimpleIntegerDynamicPseudoCost | ( | CbcModel * | model, |
int | iColumn, | ||
double | downDynamicPseudoCost, | ||
double | upDynamicPseudoCost | ||
) |
CbcSimpleIntegerDynamicPseudoCost::CbcSimpleIntegerDynamicPseudoCost | ( | CbcModel * | model, |
int | dummy, | ||
int | iColumn, | ||
double | downDynamicPseudoCost, | ||
double | upDynamicPseudoCost | ||
) |
CbcSimpleIntegerDynamicPseudoCost::CbcSimpleIntegerDynamicPseudoCost | ( | const CbcSimpleIntegerDynamicPseudoCost & | ) |
|
virtual |
|
virtual |
Clone.
Reimplemented from CbcSimpleInteger.
CbcSimpleIntegerDynamicPseudoCost& CbcSimpleIntegerDynamicPseudoCost::operator= | ( | const CbcSimpleIntegerDynamicPseudoCost & | rhs | ) |
|
virtual |
Infeasibility - large is 0.5.
Reimplemented from CbcSimpleInteger.
|
virtual |
Creates a branching object.
Reimplemented from CbcSimpleInteger.
|
virtual |
Fills in a created branching object.
Pass in information on branch just done and create CbcObjectUpdateData instance. If object does not need data then backward pointer will be NULL. Assumes can get information from solver
Reimplemented from CbcObject.
|
virtual |
Update object by CbcObjectUpdateData.
Reimplemented from CbcObject.
void CbcSimpleIntegerDynamicPseudoCost::copySome | ( | const CbcSimpleIntegerDynamicPseudoCost * | otherObject | ) |
Copy some information i.e. just variable stuff.
|
virtual |
Updates stuff like pseudocosts before threads.
|
virtual |
Updates stuff like pseudocosts after threads finished.
void CbcSimpleIntegerDynamicPseudoCost::updateAfterMini | ( | int | numberDown, |
int | numberDownInfeasible, | ||
double | sumDown, | ||
int | numberUp, | ||
int | numberUpInfeasible, | ||
double | sumUp | ||
) |
Updates stuff like pseudocosts after mini branch and bound.
|
virtual |
Create an OsiSolverBranch object.
This returns NULL if branch not represented by bound changes
Reimplemented from CbcObject.
|
inline |
Down pseudo cost.
Definition at line 98 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
void CbcSimpleIntegerDynamicPseudoCost::setDownDynamicPseudoCost | ( | double | value | ) |
Set down pseudo cost.
void CbcSimpleIntegerDynamicPseudoCost::updateDownDynamicPseudoCost | ( | double | value | ) |
Modify down pseudo cost in a slightly different way.
|
inline |
Up pseudo cost.
Definition at line 108 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
void CbcSimpleIntegerDynamicPseudoCost::setUpDynamicPseudoCost | ( | double | value | ) |
Set up pseudo cost.
void CbcSimpleIntegerDynamicPseudoCost::updateUpDynamicPseudoCost | ( | double | value | ) |
Modify up pseudo cost in a slightly different way.
|
inline |
Down pseudo shadow price cost.
Definition at line 118 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set down pseudo shadow price cost.
Definition at line 123 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Up pseudo shadow price cost.
Definition at line 128 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set up pseudo shadow price cost.
Definition at line 133 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Up down separator.
Definition at line 139 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set up down separator.
Definition at line 144 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Down sum cost.
Definition at line 150 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set down sum cost.
Definition at line 155 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Add to down sum cost and set last and square.
Definition at line 160 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Up sum cost.
Definition at line 167 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set up sum cost.
Definition at line 172 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Add to up sum cost and set last and square.
Definition at line 177 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Down sum change.
Definition at line 184 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set down sum change.
Definition at line 189 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Add to down sum change.
Definition at line 194 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Up sum change.
Definition at line 200 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set up sum change.
Definition at line 205 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Add to up sum change and set last and square.
Definition at line 210 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Sum down decrease number infeasibilities from strong or actual.
Definition at line 216 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set sum down decrease number infeasibilities from strong or actual.
Definition at line 221 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Add to sum down decrease number infeasibilities from strong or actual.
Definition at line 226 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Sum up decrease number infeasibilities from strong or actual.
Definition at line 232 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set sum up decrease number infeasibilities from strong or actual.
Definition at line 237 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Add to sum up decrease number infeasibilities from strong or actual.
Definition at line 242 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Down number times.
Definition at line 248 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set down number times.
Definition at line 253 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Increment down number times.
Definition at line 258 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Up number times.
Definition at line 264 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set up number times.
Definition at line 269 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Increment up number times.
Definition at line 274 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Number times branched.
Definition at line 280 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Down number times infeasible.
Definition at line 285 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set down number times infeasible.
Definition at line 290 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Increment down number times infeasible.
Definition at line 295 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Up number times infeasible.
Definition at line 301 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set up number times infeasible.
Definition at line 306 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Increment up number times infeasible.
Definition at line 311 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Number of times before trusted.
Definition at line 317 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set number of times before trusted.
Definition at line 322 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Increment number of times before trusted.
Definition at line 327 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
virtual |
Return "up" estimate.
|
virtual |
Return "down" estimate (default 1.0e-5)
|
inline |
method - see below for details
Definition at line 338 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
inline |
Set method.
Definition at line 343 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
void CbcSimpleIntegerDynamicPseudoCost::setDownInformation | ( | double | changeObjectiveDown, |
int | changeInfeasibilityDown | ||
) |
Pass in information on a down branch.
void CbcSimpleIntegerDynamicPseudoCost::setUpInformation | ( | double | changeObjectiveUp, |
int | changeInfeasibilityUp | ||
) |
Pass in information on a up branch.
void CbcSimpleIntegerDynamicPseudoCost::setProbingInformation | ( | int | fixedDown, |
int | fixedUp | ||
) |
Pass in probing information.
void CbcSimpleIntegerDynamicPseudoCost::print | ( | int | type = 0 , |
double | value = 0.0 |
||
) | const |
Print - 0 -summary, 1 just before strong.
bool CbcSimpleIntegerDynamicPseudoCost::same | ( | const CbcSimpleIntegerDynamicPseudoCost * | obj | ) | const |
Same - returns true if contents match(ish)
virtual OsiSolverBranch* CbcSimpleInteger::solverBranch |
Create an OsiSolverBranch object.
This returns NULL if branch not represented by bound changes
virtual OsiSolverBranch* CbcObject::solverBranch |
Create an OsiSolverBranch object.
This returns NULL if branch not represented by bound changes
|
protected |
|
protected |
Up pseudo cost.
Definition at line 366 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Up/down separator If >0.0 then do first branch up if value-floor(value) >= this value.
Definition at line 371 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Sum down cost from strong or actual.
Definition at line 373 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Sum up cost from strong or actual.
Definition at line 375 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Sum of all changes to x when going down.
Definition at line 377 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Sum of all changes to x when going up.
Definition at line 379 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
mutableprotected |
Current pseudo-shadow price estimate down.
Definition at line 381 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
mutableprotected |
Current pseudo-shadow price estimate up.
Definition at line 383 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Sum down decrease number infeasibilities from strong or actual.
Definition at line 385 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Sum up decrease number infeasibilities from strong or actual.
Definition at line 387 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Last down cost from strong (i.e. as computed by last strong)
Definition at line 389 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Last up cost from strong (i.e. as computed by last strong)
Definition at line 391 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
mutableprotected |
Last down decrease number infeasibilities from strong (i.e. as computed by last strong)
Definition at line 393 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
mutableprotected |
Last up decrease number infeasibilities from strong (i.e. as computed by last strong)
Definition at line 395 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of times we have gone down.
Definition at line 397 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of times we have gone up.
Definition at line 399 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of times we have been infeasible going down.
Definition at line 401 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of times we have been infeasible going up.
Definition at line 403 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of branches before we trust.
Definition at line 405 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of local probing fixings going down.
Definition at line 407 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of local probing fixings going up.
Definition at line 409 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of total probing fixings going down.
Definition at line 411 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of total probing fixings going up.
Definition at line 413 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of times probing done.
Definition at line 415 of file CbcSimpleIntegerDynamicPseudoCost.hpp.
|
protected |
Number of times infeasible when tested.
Method - 0 - pseudo costs 1 - probing
Definition at line 421 of file CbcSimpleIntegerDynamicPseudoCost.hpp.