|
SCIP_HeurData Struct Reference Detailed Descriptionprimal heuristic data Definition at line 62 of file heur_local.c.
Field Documentation
best solution during the previous run Definition at line 75 of file heur_rec.c.
should the heuristic be called during the root node? Definition at line 69 of file heur_local.c.
edge multplication factor for hop constrained problems Definition at line 79 of file heur_tm.c. Referenced by SCIP_DECL_HEUREXEC().
Definition at line 74 of file heur_rec.c. Referenced by SCIP_DECL_HEUREXEC().
indices of a number of best solutions already tried Definition at line 67 of file heur_local.c. Referenced by SCIP_DECL_HEUREXEC().
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.
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().
number of best solutions to improve Definition at line 66 of file heur_local.c.
number of total executions (of TM) Definition at line 78 of file heur_tm.c. Referenced by SCIPheurComputeSteinerTree().
number of fails Definition at line 64 of file heur_local.c.
number of failures since last successful call Definition at line 83 of file heur_rec.c.
number of solutions during the last run Definition at line 78 of file heur_rec.c. Referenced by SCIP_DECL_HEUREXEC().
number of solutions actually selected Definition at line 81 of file heur_rec.c. Referenced by selectdiffsols(), and selectsols().
number of runs in TM heuristic Definition at line 79 of file heur_rec.c.
number of solutions that will be taken into account Definition at line 80 of file heur_rec.c. Referenced by costMultiplier(), selectdiffsols(), and selectsols().
number of new solutions before executing the heuristic again Definition at line 82 of file heur_rec.c.
seed value for random number generator Definition at line 84 of file heur_rec.c.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||