Scippy

SCIP

Solving Constraint Integer Programs

BRANCHINGRESULTDATA Struct Reference

Detailed Description

A container to hold the result of a branching.

Definition at line 603 of file branch_lookahead.c.

Data Fields

SCIP_Real objval
 
SCIP_Real dualbound
 
SCIP_Longint niterations
 
SCIP_Bool cutoff
 
SCIP_Bool dualboundvalid
 
int ndeepestcutoffs
 
SCIP_Real deeperscore
 
SCIP_Real bestgain
 
SCIP_Real totalgains
 
int ntotalgains
 
int ndeepestnodes
 

Field Documentation

◆ objval

SCIP_Real BRANCHINGRESULTDATA::objval

The objective value of the solved lp. Only contains meaningful data, if cutoff == FALSE.

Definition at line 605 of file branch_lookahead.c.

Referenced by branchingResultDataCreate(), branchingResultDataInit(), executeBranchingRecursive(), and selectVarRecursive().

◆ dualbound

SCIP_Real BRANCHINGRESULTDATA::dualbound

The best dual bound for this branching, may be changed by deeper level branchings.

Definition at line 607 of file branch_lookahead.c.

Referenced by branchingResultDataCreate(), branchingResultDataInit(), executeBranchingRecursive(), and selectVarRecursive().

◆ niterations

SCIP_Longint BRANCHINGRESULTDATA::niterations

The number of probing iterations needed in sub branch.

Definition at line 609 of file branch_lookahead.c.

Referenced by branchingResultDataCreate(), branchingResultDataInit(), executeBranchingRecursive(), and selectVarRecursive().

◆ cutoff

SCIP_Bool BRANCHINGRESULTDATA::cutoff

Indicates whether the node was infeasible and was cutoff.

Definition at line 610 of file branch_lookahead.c.

Referenced by branchingResultDataCreate(), branchingResultDataInit(), 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 611 of file branch_lookahead.c.

Referenced by branchingResultDataCreate(), branchingResultDataInit(), executeBranchingRecursive(), and selectVarRecursive().

◆ ndeepestcutoffs

int BRANCHINGRESULTDATA::ndeepestcutoffs

number of cutoffs on the lowest level below this child

Definition at line 613 of file branch_lookahead.c.

Referenced by branchingResultDataCreate(), branchingResultDataInit(), executeBranchingRecursive(), and selectVarRecursive().

◆ deeperscore

SCIP_Real BRANCHINGRESULTDATA::deeperscore

best score computed for the deeper lookahead level

Definition at line 614 of file branch_lookahead.c.

Referenced by branchingResultDataCreate(), branchingResultDataInit(), 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 615 of file branch_lookahead.c.

Referenced by executeBranchingRecursive().

◆ totalgains

SCIP_Real BRANCHINGRESULTDATA::totalgains

sum over all gains that are valid in both children

Definition at line 616 of file branch_lookahead.c.

Referenced by executeBranchingRecursive().

◆ ntotalgains

int BRANCHINGRESULTDATA::ntotalgains

number of gains summed in totalgains

Definition at line 617 of file branch_lookahead.c.

Referenced by executeBranchingRecursive().

◆ ndeepestnodes

int BRANCHINGRESULTDATA::ndeepestnodes

number of nodes processed in the deepest level

Definition at line 618 of file branch_lookahead.c.

Referenced by executeBranchingRecursive(), and selectVarRecursive().