|
| AbcBranchDefaultDecision () |
|
| AbcBranchDefaultDecision (const AbcBranchDefaultDecision &) |
|
virtual | ~AbcBranchDefaultDecision () |
|
virtual AbcBranchDecision * | clone () const |
| Clone. More...
|
|
virtual void | initialize (AbcModel *model) |
| Initialize, e.g. before the start of branch selection at a node. More...
|
|
virtual int | betterBranch (int thisOne, int bestSoFar, double changeUp, int numInfUp, double changeDn, int numInfDn) |
| Compare two branching objects. More...
|
|
| AbcBranchDefaultDecision () |
|
| AbcBranchDefaultDecision (const AbcBranchDefaultDecision &) |
|
virtual | ~AbcBranchDefaultDecision () |
|
virtual AbcBranchDecision * | clone () const |
| Clone. More...
|
|
virtual void | initialize (AbcModel *model) |
| Initialize, e.g. before the start of branch selection at a node. More...
|
|
virtual int | betterBranch (int thisOne, int bestSoFar, double changeUp, int numInfUp, double changeDn, int numInfDn) |
| Compare two branching objects. More...
|
|
| AbcBranchDefaultDecision () |
|
| AbcBranchDefaultDecision (const AbcBranchDefaultDecision &) |
|
virtual | ~AbcBranchDefaultDecision () |
|
virtual AbcBranchDecision * | clone () const |
| Clone. More...
|
|
virtual void | initialize (AbcModel *model) |
| Initialize, e.g. before the start of branch selection at a node. More...
|
|
virtual int | betterBranch (int thisOne, int bestSoFar, double changeUp, int numInfUp, double changeDn, int numInfDn) |
| Compare two branching objects. More...
|
|
| AbcBranchDecision () |
| Default Constructor. More...
|
|
virtual | ~AbcBranchDecision () |
| Destructor. More...
|
|
virtual int | bestBranch (AbcModel *model, int *objects, int numberObjects, int numberUnsatisfied, double *changeUp, int *numberInfeasibilitiesUp, double *changeDown, int *numberInfeasibilitiesDown, double objectiveValue) |
| Compare N branching objects. More...
|
|
| AbcBranchDecision () |
| Default Constructor. More...
|
|
virtual | ~AbcBranchDecision () |
| Destructor. More...
|
|
virtual int | bestBranch (AbcModel *model, int *objects, int numberObjects, int numberUnsatisfied, double *changeUp, int *numberInfeasibilitiesUp, double *changeDown, int *numberInfeasibilitiesDown, double objectiveValue) |
| Compare N branching objects. More...
|
|
| AbcBranchDecision () |
| Default Constructor. More...
|
|
virtual | ~AbcBranchDecision () |
| Destructor. More...
|
|
virtual int | bestBranch (AbcModel *model, int *objects, int numberObjects, int numberUnsatisfied, double *changeUp, int *numberInfeasibilitiesUp, double *changeDown, int *numberInfeasibilitiesDown, double objectiveValue) |
| Compare N branching objects. More...
|
|
Branching decision default class.
This class implements a simple default algorithm (betterBranch()) for choosing a branching variable.
Definition at line 42 of file AbcBranchActual.h.
virtual int AbcBranchDefaultDecision::betterBranch |
( |
int |
thisOne, |
|
|
int |
bestSoFar, |
|
|
double |
changeUp, |
|
|
int |
numInfUp, |
|
|
double |
changeDn, |
|
|
int |
numInfDn |
|
) |
| |
|
virtual |
Compare two branching objects.
Return nonzero if thisOne
is better than bestSoFar
.
The routine compares branches using the values supplied in numInfUp
and numInfDn
until a solution is found by search, after which it uses the values supplied in changeUp
and changeDn
. The best branching object seen so far and the associated parameter values are remembered in the AbcBranchDefaultDecision
object. The nonzero return value is +1 if the up branch is preferred, -1 if the down branch is preferred.
As the names imply, the assumption is that the values supplied for numInfUp
and numInfDn
will be the number of infeasibilities reported by the branching object, and changeUp
and changeDn
will be the estimated change in objective. Other measures can be used if desired.
Because an AbcBranchDefaultDecision
object remembers the current best branching candidate (bestObject_) as well as the values used in the comparison, the parameter bestSoFar
is redundant, hence unused.
Implements AbcBranchDecision.
virtual int AbcBranchDefaultDecision::betterBranch |
( |
int |
thisOne, |
|
|
int |
bestSoFar, |
|
|
double |
changeUp, |
|
|
int |
numInfUp, |
|
|
double |
changeDn, |
|
|
int |
numInfDn |
|
) |
| |
|
virtual |
Compare two branching objects.
Return nonzero if thisOne
is better than bestSoFar
.
The routine compares branches using the values supplied in numInfUp
and numInfDn
until a solution is found by search, after which it uses the values supplied in changeUp
and changeDn
. The best branching object seen so far and the associated parameter values are remembered in the AbcBranchDefaultDecision
object. The nonzero return value is +1 if the up branch is preferred, -1 if the down branch is preferred.
As the names imply, the assumption is that the values supplied for numInfUp
and numInfDn
will be the number of infeasibilities reported by the branching object, and changeUp
and changeDn
will be the estimated change in objective. Other measures can be used if desired.
Because an AbcBranchDefaultDecision
object remembers the current best branching candidate (bestObject_) as well as the values used in the comparison, the parameter bestSoFar
is redundant, hence unused.
Implements AbcBranchDecision.
virtual int AbcBranchDefaultDecision::betterBranch |
( |
int |
thisOne, |
|
|
int |
bestSoFar, |
|
|
double |
changeUp, |
|
|
int |
numInfUp, |
|
|
double |
changeDn, |
|
|
int |
numInfDn |
|
) |
| |
|
virtual |
Compare two branching objects.
Return nonzero if thisOne
is better than bestSoFar
.
The routine compares branches using the values supplied in numInfUp
and numInfDn
until a solution is found by search, after which it uses the values supplied in changeUp
and changeDn
. The best branching object seen so far and the associated parameter values are remembered in the AbcBranchDefaultDecision
object. The nonzero return value is +1 if the up branch is preferred, -1 if the down branch is preferred.
As the names imply, the assumption is that the values supplied for numInfUp
and numInfDn
will be the number of infeasibilities reported by the branching object, and changeUp
and changeDn
will be the estimated change in objective. Other measures can be used if desired.
Because an AbcBranchDefaultDecision
object remembers the current best branching candidate (bestObject_) as well as the values used in the comparison, the parameter bestSoFar
is redundant, hence unused.
Implements AbcBranchDecision.