Couenne 0.5.8
|
#include <CouenneChooseStrong.hpp>
Static Public Member Functions | |
static void | registerOptions (Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions) |
Add list of options to be read from file. | |
![]() | |
static void | registerOptions (Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions) |
Protected Member Functions | |
int | simulateBranch (OsiObject *Object, OsiBranchingInformation *info, OsiBranchingObject *branch, OsiSolverInterface *solver, Bonmin::HotInfo *result, int direction) |
does one side of the branching | |
![]() | |
int | determineStatus (OsiSolverInterface *solver) const |
bool | isRootNode (const OsiBranchingInformation *info) const |
Additional Inherited Members | |
![]() | |
enum | DoStrongReturnStatuses |
enum | chooseVariableReturnStatuses |
enum | Messages_Types |
![]() | |
provenInfeasible | |
doneNoFixing | |
doneCanFix | |
interuptedCanFix | |
maxTime | |
infeasibleNode | |
hasCandidate | |
feasibleNode | |
canFixAndStrongBranch | |
canFixAndBranch | |
canFixNoCandidate | |
PS_COST_HISTORY | |
PS_COST_MULT | |
PS_COST_ESTIMATES | |
CANDIDATE_LIST | |
CANDIDATE_LIST2 | |
CANDIDATE_LIST3 | |
SB_START | |
SB_HEADER | |
SB_RES | |
BRANCH_VAR | |
CHOSEN_VAR | |
UPDATE_PS_COST | |
BON_CHOOSE_MESSAGES_DUMMY_END | |
![]() | |
enum | StrongStatus |
![]() | |
static const std::string | CNAME |
Definition at line 23 of file CouenneChooseStrong.hpp.
Couenne::CouenneChooseStrong::CouenneChooseStrong | ( | Bonmin::BabSetupBase & | b, |
CouenneProblem * | problem, | ||
JnlstPtr | jnlst | ||
) |
Constructor from solver (so we can set up arrays etc)
Couenne::CouenneChooseStrong::CouenneChooseStrong | ( | const CouenneChooseStrong & | ) |
Copy constructor.
|
virtual |
Destructor.
CouenneChooseStrong & Couenne::CouenneChooseStrong::operator= | ( | const CouenneChooseStrong & | rhs | ) |
Assignment operator.
|
virtual |
Clone.
Reimplemented from Bonmin::BonChooseVariable.
|
virtual |
Sets up strong list and clears all if initialize is true.
Returns number of infeasibilities.
Reimplemented from Bonmin::BonChooseVariable.
int Couenne::CouenneChooseStrong::gutsOfSetupList | ( | OsiBranchingInformation * | info, |
bool | initialize | ||
) |
|
virtual |
This is a utility function which does strong branching on a list of objects and stores the results in OsiHotInfo.objects.
On entry the object sequence is stored in the OsiHotInfo object and maybe more. It returns - -1 - one branch was infeasible both ways 0 - all inspected - nothing can be fixed 1 - all inspected - some can be fixed (returnCriterion==0) 2 - may be returning early - one can be fixed (last one done) (returnCriterion==1) 3 - returning because max time
Reimplemented from Bonmin::BonChooseVariable.
|
virtual |
Returns true if solution looks feasible against given objects.
Reimplemented from OsiChooseVariable.
|
virtual |
choose object to branch based on earlier setup
Reimplemented from Bonmin::BonChooseVariable.
|
static |
Add list of options to be read from file.
|
protected |
does one side of the branching
|
protected |
Pointer to the associated MINLP problem.
Definition at line 119 of file CouenneChooseStrong.hpp.
|
protected |
should we update the pseudocost multiplier with the distance between the LP point and the solution of the resulting branches' LPs? If so, this only happens in strong branching
Definition at line 124 of file CouenneChooseStrong.hpp.
|
protected |
Normally, a convex combination of the min/max lower bounds' estimates is taken to select a branching variable, as in the original definition of strong branching.
If this option is set to true, their product is taken instead:
(1e-6+min) * max
where the 1e-6 is used to ensure that even those with one subproblem with no improvement are compared.
Definition at line 135 of file CouenneChooseStrong.hpp.
|
protected |
pointer to journalist for detailed information
Definition at line 138 of file CouenneChooseStrong.hpp.
|
protected |
total time spent in strong branching
Definition at line 141 of file CouenneChooseStrong.hpp.