Scippy

SCIP

Solving Constraint Integer Programs

SCIP_HeurData Struct Reference

Detailed Description

primal heuristic data

Definition at line 62 of file heur_local.c.

Data Fields

int nfails
 
int maxnsols
 
int nbestsols
 
int * lastsolindices
 
SCIP_Bool maxfreq
 
SCIP_Bool duringroot
 
int lastsolindex
 
int bestsolindex
 
SCIP_Longint ncalls
 
SCIP_Longint nlastsols
 
int ntmruns
 
int nusedsols
 
int nselectedsols
 
int nwaitingsols
 
int nfailures
 
unsigned int randseed
 
SCIP_Longint nlpiterations
 
SCIP_Longint nexecs
 
SCIP_Real hopfactor
 
int stp_type
 
int evalruns
 
int initruns
 
int leafruns
 
int rootruns
 
int duringlpfreq
 
int type
 
int beststartnode
 
unsigned int timing
 

Field Documentation

int SCIP_HeurData::bestsolindex

best solution during the previous run

Definition at line 75 of file heur_rec.c.

int SCIP_HeurData::beststartnode

start node of the so far best found solution

Definition at line 87 of file heur_tm.c.

int SCIP_HeurData::duringlpfreq

frequency during LP solving

Definition at line 85 of file heur_tm.c.

SCIP_Bool SCIP_HeurData::duringroot

should the heuristic be called during the root node?

Definition at line 69 of file heur_local.c.

int SCIP_HeurData::evalruns

number of runs

Definition at line 81 of file heur_tm.c.

SCIP_Real SCIP_HeurData::hopfactor

edge multplication factor for hop constrained problems

Definition at line 79 of file heur_tm.c.

Referenced by SCIP_DECL_HEUREXEC().

int SCIP_HeurData::initruns

number of initial runs

Definition at line 82 of file heur_tm.c.

int SCIP_HeurData::lastsolindex

Definition at line 74 of file heur_rec.c.

Referenced by SCIP_DECL_HEUREXEC().

int* SCIP_HeurData::lastsolindices

indices of a number of best solutions already tried

Definition at line 67 of file heur_local.c.

Referenced by SCIP_DECL_HEUREXEC().

int SCIP_HeurData::leafruns

number of runs at leafs

Definition at line 83 of file heur_tm.c.

SCIP_Bool SCIP_HeurData::maxfreq

should the heuristic be called with maximum frequency?

should the heuristic be called at maximum frequency?

Definition at line 68 of file heur_local.c.

int SCIP_HeurData::maxnsols

maximal number of best solutions to improve

maximum number of (good) solutions be regarded in the subproblem

Definition at line 65 of file heur_local.c.

Referenced by selectdiffsols(), and selectsols().

int SCIP_HeurData::nbestsols

number of best solutions to improve

Definition at line 66 of file heur_local.c.

SCIP_Longint SCIP_HeurData::ncalls

number of calls

number of total calls (of TM)

Definition at line 77 of file heur_rec.c.

SCIP_Longint SCIP_HeurData::nexecs

number of total executions (of TM)

Definition at line 78 of file heur_tm.c.

Referenced by SCIPheurComputeSteinerTree().

int SCIP_HeurData::nfails

number of fails

Definition at line 64 of file heur_local.c.

int SCIP_HeurData::nfailures

number of failures since last successful call

Definition at line 83 of file heur_rec.c.

SCIP_Longint SCIP_HeurData::nlastsols

number of solutions during the last run

Definition at line 78 of file heur_rec.c.

Referenced by SCIP_DECL_HEUREXEC().

SCIP_Longint SCIP_HeurData::nlpiterations

number of total LP iterations

Definition at line 76 of file heur_tm.c.

int SCIP_HeurData::nselectedsols

number of solutions actually selected

Definition at line 81 of file heur_rec.c.

Referenced by selectdiffsols(), and selectsols().

int SCIP_HeurData::ntmruns

number of runs in TM heuristic

Definition at line 79 of file heur_rec.c.

int SCIP_HeurData::nusedsols

number of solutions that will be taken into account

Definition at line 80 of file heur_rec.c.

Referenced by costMultiplier(), selectdiffsols(), and selectsols().

int SCIP_HeurData::nwaitingsols

number of new solutions before executing the heuristic again

Definition at line 82 of file heur_rec.c.

unsigned int SCIP_HeurData::randseed

seed value for random number generator

Definition at line 84 of file heur_rec.c.

int SCIP_HeurData::rootruns

number of runs at the root

Definition at line 84 of file heur_tm.c.

int SCIP_HeurData::stp_type

problem type

Definition at line 80 of file heur_tm.c.

Referenced by SCIPheurComputeSteinerTree().

unsigned int SCIP_HeurData::timing

timing for timing mask

Definition at line 89 of file heur_tm.c.

int SCIP_HeurData::type

Heuristic type: 0 automatic, 1 TM_SP, 2 TM_VORONOI, 3 TM_DIJKSTRA

Definition at line 86 of file heur_tm.c.