SCIP
Solving Constraint Integer Programs
BRANCHINGRESULTDATA Struct Reference
Detailed Description
A container to hold the result of a branching.
Definition at line 589 of file branch_lookahead.c.
Field Documentation
◆ objval
| SCIP_Real BRANCHINGRESULTDATA::objval |
The objective value of the solved lp. Only contains meaningful data, if cutoff == FALSE.
Definition at line 591 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateScoreFromResult2(), executeBranching(), executeBranchingRecursive(), getOldBranching(), and selectVarRecursive().
◆ dualbound
| SCIP_Real BRANCHINGRESULTDATA::dualbound |
The best dual bound for this branching, may be changed by deeper level branchings.
Definition at line 593 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateCutoffScore(), calculateRelCutoffScore(), calculateScoreFromResult(), calculateScoreFromResult2(), calculateWeightedGain(), executeBranching(), executeBranchingRecursive(), getOldBranching(), selectVarRecursive(), and updateOldBranching().
◆ niterations
| SCIP_Longint BRANCHINGRESULTDATA::niterations |
The number of probing iterations needed in sub branch.
Definition at line 595 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), executeBranching(), executeBranchingRecursive(), selectVarRecursive(), and updateOldBranching().
◆ cutoff
| SCIP_Bool BRANCHINGRESULTDATA::cutoff |
Indicates whether the node was infeasible and was cutoff.
Definition at line 596 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateCutoffScore(), calculateRelCutoffScore(), calculateScoreFromDeeperscore(), calculateScoreFromDeeperscoreAndCutoffs(), calculateScoreFromResult(), calculateScoreFromResult2(), calculateWeightedGain(), executeBranching(), executeBranchingRecursive(), and selectVarRecursive().
◆ dualboundvalid
| SCIP_Bool BRANCHINGRESULTDATA::dualboundvalid |
Is the value of the dual bound valid? That means, was the according LP or the sub problems solved to optimality?
Definition at line 597 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), executeBranching(), executeBranchingRecursive(), getOldBranching(), selectVarRecursive(), and updateOldBranching().
◆ ndeepestcutoffs
| int BRANCHINGRESULTDATA::ndeepestcutoffs |
number of cutoffs on the lowest level below this child
Definition at line 599 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateCutoffScore(), calculateRelCutoffScore(), calculateScaledCutoffScore(), calculateScoreFromDeeperscoreAndCutoffs(), calculateWeightedCutoffScore(), executeBranchingRecursive(), and selectVarRecursive().
◆ deeperscore
| SCIP_Real BRANCHINGRESULTDATA::deeperscore |
best score computed for the deeper lookahead level
Definition at line 600 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateScoreFromDeeperscore(), calculateScoreFromDeeperscoreAndCutoffs(), and executeBranchingRecursive().
◆ bestgain
| SCIP_Real BRANCHINGRESULTDATA::bestgain |
best gain (w.r.t. to the base lp) on the lowest level below this child
Definition at line 601 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateScaledCutoffScore(), calculateWeightedCutoffScore(), and executeBranchingRecursive().
◆ totalgains
| SCIP_Real BRANCHINGRESULTDATA::totalgains |
sum over all gains that are valid in both children
Definition at line 602 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateScaledCutoffScore(), calculateScoreFromDeeperscoreAndCutoffs(), calculateWeightedCutoffScore(), and executeBranchingRecursive().
◆ ntotalgains
| int BRANCHINGRESULTDATA::ntotalgains |
number of gains summed in totalgains
Definition at line 603 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateScaledCutoffScore(), calculateScoreFromDeeperscoreAndCutoffs(), calculateWeightedCutoffScore(), and executeBranchingRecursive().
◆ ndeepestnodes
| int BRANCHINGRESULTDATA::ndeepestnodes |
number of nodes processed in the deepest level
Definition at line 604 of file branch_lookahead.c.
Referenced by branchingResultDataCopy(), branchingResultDataInit(), calculateRelCutoffScore(), calculateScoreFromDeeperscoreAndCutoffs(), calculateWeightedCutoffScore(), executeBranchingRecursive(), and selectVarRecursive().