SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
primal heuristics data
Definition at line 78 of file struct_heur.h.
#include <struct_heur.h>
Public Member Functions | |
| SCIP_DECL_HEURCOPY ((*heurcopy)) | |
| SCIP_DECL_HEURFREE ((*heurfree)) | |
| SCIP_DECL_HEURINIT ((*heurinit)) | |
| SCIP_DECL_HEUREXIT ((*heurexit)) | |
| SCIP_DECL_HEURINITSOL ((*heurinitsol)) | |
| SCIP_DECL_HEUREXITSOL ((*heurexitsol)) | |
| SCIP_DECL_HEUREXEC ((*heurexec)) | |
Data Fields | |
| SCIP_Longint | ncalls |
| SCIP_Longint | nsolsfound |
| SCIP_Longint | nbestsolsfound |
| char * | name |
| char * | desc |
| SCIP_HEURDATA * | heurdata |
| SCIP_DIVESET ** | divesets |
| SCIP_CLOCK * | setuptime |
| SCIP_CLOCK * | heurclock |
| int | priority |
| int | freq |
| int | freqofs |
| int | maxdepth |
| int | delaypos |
| int | ndivesets |
| SCIP_HEURTIMING | timingmask |
| SCIP_Bool | usessubscip |
| SCIP_Bool | initialized |
| char | dispchar |
| SCIP_Heur::SCIP_DECL_HEURCOPY | ( | * | heurcopy | ) |
copy method of primal heuristic or NULL if you don't want to copy your plugin into sub-SCIPs
| SCIP_Heur::SCIP_DECL_HEURFREE | ( | * | heurfree | ) |
destructor of primal heuristic
| SCIP_Heur::SCIP_DECL_HEURINIT | ( | * | heurinit | ) |
initialize primal heuristic
| SCIP_Heur::SCIP_DECL_HEUREXIT | ( | * | heurexit | ) |
deinitialize primal heuristic
| SCIP_Heur::SCIP_DECL_HEURINITSOL | ( | * | heurinitsol | ) |
solving process initialization method of primal heuristic
| SCIP_Heur::SCIP_DECL_HEUREXITSOL | ( | * | heurexitsol | ) |
solving process deinitialization method of primal heuristic
| SCIP_Heur::SCIP_DECL_HEUREXEC | ( | * | heurexec | ) |
execution method of primal heuristic
| SCIP_Longint SCIP_Heur::ncalls |
number of times, this heuristic was called
Definition at line 80 of file struct_heur.h.
Referenced by SCIP_DECL_SORTPTRCOMP(), SCIPcopyConcurrentSolvingStats(), SCIPheurExec(), SCIPheurGetNCalls(), and SCIPheurInit().
| SCIP_Longint SCIP_Heur::nsolsfound |
number of feasible primal solutions found so far by this heuristic
Definition at line 81 of file struct_heur.h.
Referenced by SCIPcopyConcurrentSolvingStats(), SCIPheurExec(), SCIPheurGetNSolsFound(), and SCIPheurInit().
| SCIP_Longint SCIP_Heur::nbestsolsfound |
number of new best primal CIP solutions found so far by this heuristic
Definition at line 82 of file struct_heur.h.
Referenced by SCIPcopyConcurrentSolvingStats(), SCIPheurExec(), SCIPheurGetNBestSolsFound(), and SCIPheurInit().
| char* SCIP_Heur::name |
name of primal heuristic
Definition at line 83 of file struct_heur.h.
Referenced by SCIPheurExec(), SCIPheurExit(), SCIPheurGetName(), and SCIPheurInit().
| char* SCIP_Heur::desc |
description of primal heuristic
Definition at line 84 of file struct_heur.h.
Referenced by SCIPheurGetDesc().
| SCIP_HEURDATA* SCIP_Heur::heurdata |
primal heuristics local data
Definition at line 92 of file struct_heur.h.
Referenced by SCIPheurGetData(), and SCIPheurSetData().
| SCIP_DIVESET** SCIP_Heur::divesets |
array of diving controllers of this heuristic
Definition at line 93 of file struct_heur.h.
Referenced by heurAddDiveset(), SCIPheurGetDivesets(), and SCIPheurInit().
| SCIP_CLOCK* SCIP_Heur::setuptime |
time spend for setting up this heuristic for the next stages
Definition at line 94 of file struct_heur.h.
Referenced by SCIPcopyConcurrentSolvingStats(), SCIPheurEnableOrDisableClocks(), SCIPheurExit(), SCIPheurExitsol(), SCIPheurGetSetupTime(), SCIPheurInit(), and SCIPheurInitsol().
| SCIP_CLOCK* SCIP_Heur::heurclock |
heuristic execution time
Definition at line 95 of file struct_heur.h.
Referenced by SCIPcopyConcurrentSolvingStats(), SCIPheurEnableOrDisableClocks(), SCIPheurExec(), SCIPheurGetTime(), and SCIPheurInit().
| int SCIP_Heur::priority |
priority of the primal heuristic
Definition at line 96 of file struct_heur.h.
Referenced by SCIP_DECL_SORTPTRCOMP(), SCIPheurGetPriority(), and SCIPheurSetPriority().
| int SCIP_Heur::freq |
frequency for calling primal heuristic
Definition at line 97 of file struct_heur.h.
Referenced by SCIP_DECL_SORTPTRCOMP(), SCIPheurExec(), SCIPheurGetFreq(), SCIPheurSetFreq(), and SCIPheurShouldBeExecuted().
| int SCIP_Heur::freqofs |
frequency offset for calling primal heuristic
Definition at line 98 of file struct_heur.h.
Referenced by SCIPheurExec(), SCIPheurGetFreqofs(), and SCIPheurShouldBeExecuted().
| int SCIP_Heur::maxdepth |
maximal depth level to call heuristic at (-1: no limit)
Definition at line 99 of file struct_heur.h.
Referenced by SCIPheurExec(), SCIPheurGetMaxdepth(), and SCIPheurShouldBeExecuted().
| int SCIP_Heur::delaypos |
position in the delayed heuristics queue, or -1 if not delayed
Definition at line 100 of file struct_heur.h.
Referenced by SCIP_DECL_SORTPTRCOMP(), SCIPheurExec(), SCIPheurInit(), SCIPheurInitsol(), and SCIPheurShouldBeExecuted().
| int SCIP_Heur::ndivesets |
number of diving controllers of this heuristic
Definition at line 101 of file struct_heur.h.
Referenced by heurAddDiveset(), SCIPheurGetNDivesets(), and SCIPheurInit().
| SCIP_HEURTIMING SCIP_Heur::timingmask |
positions in the node solving loop where heuristic should be executed
Definition at line 102 of file struct_heur.h.
Referenced by SCIPheurGetTimingmask(), SCIPheurSetTimingmask(), and SCIPheurShouldBeExecuted().
| SCIP_Bool SCIP_Heur::usessubscip |
does the heuristic use a secondary SCIP instance?
Definition at line 103 of file struct_heur.h.
Referenced by SCIPheurUsesSubscip().
| SCIP_Bool SCIP_Heur::initialized |
is primal heuristic initialized?
Definition at line 104 of file struct_heur.h.
Referenced by SCIPheurExit(), SCIPheurInit(), and SCIPheurIsInitialized().
| char SCIP_Heur::dispchar |
display character of primal heuristic
Definition at line 105 of file struct_heur.h.
Referenced by SCIPheurGetDispchar().