diving heuristic data structure with statistics and diveset
Definition at line 418 of file heur_scheduler.c.
Data Fields | |
SCIP_DIVESET * | diveset |
HEUR_STATS * | stats |
SCIP_Longint | nodelimit |
SOLVEFREQ * | solvefreqdata |
SCIP_Real | priority |
int | rootnodepriority |
SCIP_DIVESET* Diving_Heur::diveset |
publicly available divesets from diving heuristics
Definition at line 420 of file heur_scheduler.c.
Referenced by executeDivingHeuristic().
HEUR_STATS* Diving_Heur::stats |
statistics for this diveset
Definition at line 421 of file heur_scheduler.c.
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().
SOLVEFREQ* Diving_Heur::solvefreqdata |
solve frequency data
Definition at line 423 of file heur_scheduler.c.
Referenced by executeDivingHeuristic().
SCIP_Real Diving_Heur::priority |
positive call priority to initialize bandit algorithms
Definition at line 424 of file heur_scheduler.c.
int Diving_Heur::rootnodepriority |
heuristic's priority for call at rootnode
Definition at line 425 of file heur_scheduler.c.