Scippy

SCIP

Solving Constraint Integer Programs

Diving_Heur Struct Reference

Detailed Description

diving heuristic data structure with statistics and diveset

Definition at line 418 of file heur_scheduler.c.

Data Fields

SCIP_DIVESETdiveset
 
HEUR_STATSstats
 
SCIP_Longint nodelimit
 
SOLVEFREQsolvefreqdata
 
SCIP_Real priority
 
int rootnodepriority
 

Field Documentation

◆ diveset

SCIP_DIVESET* Diving_Heur::diveset

publicly available divesets from diving heuristics

Definition at line 420 of file heur_scheduler.c.

Referenced by executeDivingHeuristic(), includeDivingHeurs(), and printDivingHeurStatistics().

◆ stats

HEUR_STATS* Diving_Heur::stats

statistics for this diveset

Definition at line 421 of file heur_scheduler.c.

Referenced by includeDivingHeurs(), printDivingHeurStatistics(), schedulerFreeDivingHeur(), and updateHeurStatsDiving().

◆ nodelimit

SCIP_Longint Diving_Heur::nodelimit

node limit of diving heuristics for next execution

Definition at line 422 of file heur_scheduler.c.

Referenced by executeDivingHeuristic(), includeDivingHeurs(), printDivingHeurStatistics(), and updateSolveFreq().

◆ solvefreqdata

SOLVEFREQ* Diving_Heur::solvefreqdata

◆ priority

SCIP_Real Diving_Heur::priority

positive call priority to initialize bandit algorithms

Definition at line 424 of file heur_scheduler.c.

Referenced by includeDivingHeurs().

◆ rootnodepriority

int Diving_Heur::rootnodepriority

heuristic's priority for call at rootnode

Definition at line 425 of file heur_scheduler.c.

Referenced by includeDivingHeurs().