RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://scip.zib.de/doc/html/heur__sync_8c_source.php below:

SCIP Doxygen Documentation: heur_sync.c Source File

42#define HEUR_NAME "sync" 43#define HEUR_DESC "heuristic for synchronizing solution" 44#define HEUR_DISPCHAR 'S' 45#define HEUR_PRIORITY -3000000 48#define HEUR_MAXDEPTH -1 49#define HEUR_TIMING SCIP_HEURTIMING_DURINGLPLOOP | SCIP_HEURTIMING_BEFOREPRESOL | SCIP_HEURTIMING_BEFORENODE 50#define HEUR_USESSUBSCIP FALSE 77

assert( heur !=

NULL

);

85

assert(heurdata !=

NULL

);

86

assert(heurdata->nsols == 0);

101

assert( heur !=

NULL

);

109

assert(heurdata !=

NULL

);

112 for

( i = 0; i < heurdata->nsols; ++i )

129

assert(heur !=

NULL

);

132

assert(result !=

NULL

);

139

assert(heurdata !=

NULL

);

140

assert(heurdata->nsols > 0);

144 for

( i = 0; i < heurdata->nsols; ++i )

179

assert(heur !=

NULL

);

200

assert(heur !=

NULL

);

201

assert(sol !=

NULL

);

206

assert(heurdata !=

NULL

);

214 if

( heurdata->nsols < heurdata->maxnsols )

218

i = heurdata->nsols++;

222

heurdata->sols[i] = heurdata->sols[i - 1];

225

heurdata->sols[i] = sol;

239

heurdata->sols[i - 1] = heurdata->sols[i];

252

heurdata->sols[i-1] = sol;

260

assert(heurdata->nsols > 0);

261

assert(heurdata->nsols <= heurdata->maxnsols);

SCIP_RETCODE SCIPheurSyncPassSol(SCIP *scip, SCIP_HEUR *heur, SCIP_SOL *sol)

SCIP_RETCODE SCIPgetIntParam(SCIP *scip, const char *name, int *value)

SCIP_RETCODE SCIPincludeHeurSync(SCIP *scip)

SCIP_HEURDATA * SCIPheurGetData(SCIP_HEUR *heur)

SCIP_RETCODE SCIPincludeHeurBasic(SCIP *scip, SCIP_HEUR **heur, const char *name, const char *desc, char dispchar, int priority, int freq, int freqofs, int maxdepth, SCIP_HEURTIMING timingmask, SCIP_Bool usessubscip, SCIP_DECL_HEUREXEC((*heurexec)), SCIP_HEURDATA *heurdata)

SCIP_RETCODE SCIPsetHeurFree(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEURFREE((*heurfree)))

SCIP_RETCODE SCIPsetHeurExit(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEUREXIT((*heurexit)))

void SCIPheurSetFreq(SCIP_HEUR *heur, int freq)

int SCIPheurGetFreq(SCIP_HEUR *heur)

const char * SCIPheurGetName(SCIP_HEUR *heur)

#define SCIPfreeBlockMemoryArray(scip, ptr, num)

#define SCIPallocBlockMemoryArray(scip, ptr, num)

#define SCIPfreeBlockMemory(scip, ptr)

#define SCIPallocBlockMemory(scip, ptr)

SCIP_RETCODE SCIPfreeSol(SCIP *scip, SCIP_SOL **sol)

SCIP_RETCODE SCIPtrySolFree(SCIP *scip, SCIP_SOL **sol, SCIP_Bool printreason, SCIP_Bool completely, SCIP_Bool checkbounds, SCIP_Bool checkintegrality, SCIP_Bool checklprows, SCIP_Bool *stored)

SCIP_Real SCIPgetSolTransObj(SCIP *scip, SCIP_SOL *sol)

void SCIPsolSetHeur(SCIP_SOL *sol, SCIP_HEUR *heur)

static SCIP_DECL_HEUREXITSOL(heurExitSync)

static SCIP_DECL_HEURFREE(heurFreeSync)

static SCIP_DECL_HEUREXEC(heurExecSync)

primal heuristic that adds given solutions

struct SCIP_HeurData SCIP_HEURDATA

enum SCIP_Retcode SCIP_RETCODE

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4