RetroSearch Browse

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

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

SCIP Doxygen Documentation: heur_zeroobj.c Source File

61#define HEUR_NAME "zeroobj" 62#define HEUR_DESC "heuristic trying to solve the problem without objective" 63#define HEUR_DISPCHAR SCIP_HEURDISPCHAR_LNS 64#define HEUR_PRIORITY 100 67#define HEUR_MAXDEPTH 0 68#define HEUR_TIMING SCIP_HEURTIMING_BEFORENODE | SCIP_HEURTIMING_BEFOREPRESOL 69#define HEUR_USESSUBSCIP TRUE 72#define EVENTHDLR_NAME "Zeroobj" 73#define EVENTHDLR_DESC "LP event handler for "

HEUR_NAME " heuristic"

76#define DEFAULT_MAXNODES 1000LL 77#define DEFAULT_MINIMPROVE 0.01 78#define DEFAULT_MINNODES 100LL 79#define DEFAULT_MAXLPITERS 5000LL 80#define DEFAULT_NODESOFS 100LL 81#define DEFAULT_NODESQUOT 0.1 82#define DEFAULT_ADDALLSOLS FALSE 83#define DEFAULT_ONLYWITHOUTSOL TRUE 84#define DEFAULT_USEUCT FALSE 121

assert(eventhdlr !=

NULL

);

122

assert(eventdata !=

NULL

);

124

assert(event !=

NULL

);

128

assert(heurdata !=

NULL

);

145

assert(heur !=

NULL

);

160

assert( heur !=

NULL

);

165

assert( heurdata !=

NULL

);

181

assert( heur !=

NULL

);

186

assert( heurdata !=

NULL

);

189

heurdata->usednodes = 0;

202

assert( heur !=

NULL

);

204

assert( result !=

NULL

);

208

assert( heurdata !=

NULL

);

216 nnodes

+= heurdata->nodesofs;

219 nnodes

-= heurdata->usednodes;

223 if

( nnodes < heurdata->minnodes )

232 SCIPdebugMsg

(

scip

"skipping zeroobj: pure feasibility problem anyway\n"

);

271

assert(subscip !=

NULL

);

272

assert(heur !=

NULL

);

273

assert(result !=

NULL

);

276

assert(heurdata !=

NULL

);

290 SCIPdebugMsg

(

scip

"Copying the SCIP instance was %s complete.\n"

, valid ?

""

"not "

);

295 if

( eventhdlr ==

NULL

)

307 for

( i = 0; i < nvars; i++ )

315 if

( subvars[i] ==

NULL

)

329

adjustedbound =

MAX

(large, lb+large);

330

adjustedbound =

MIN

(adjustedbound, inf);

335

adjustedbound =

MIN

(-large, ub-large);

336

adjustedbound =

MAX

(adjustedbound, -inf);

436

cutoff =

MIN

(upperbound, cutoff);

440 for

( i = 0; i < nvars; ++i)

444

assert(subvars[i] !=

NULL

);

476 for

( i = 0; i < nsubsols && (!success || heurdata->addallsols); ++i )

518

assert(heur !=

NULL

);

519

assert(result !=

NULL

);

522

assert(0.0 <= minimprove && minimprove <= 1.0);

532

assert(heurdata !=

NULL

);

573

assert(heur !=

NULL

);

582 "maximum number of nodes to regard in the subproblem"

586 "number of nodes added to the contingent of the total nodes"

590 "minimum number of nodes required to start the subproblem"

594 "maximum number of LP iterations to be performed in the subproblem"

598 "contingent of sub problem nodes in relation to the number of nodes of the original problem"

602 "factor by which zeroobj should at least improve the incumbent"

606 "should all subproblem solutions be added to the original SCIP?"

610 "should heuristic only be executed if no primal solution was found, yet?"

613 "should uct node selection be used at the beginning of the search?"

Constraint handler for linear constraints in their most general form, .

#define SCIP_CALL_ABORT(x)

#define SCIP_LONGINT_FORMAT

SCIP_RETCODE SCIPaddCoefLinear(SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var, SCIP_Real val)

SCIP_RETCODE SCIPcreateConsLinear(SCIP *scip, SCIP_CONS **cons, const char *name, int nvars, SCIP_VAR **vars, SCIP_Real *vals, SCIP_Real lhs, SCIP_Real rhs, SCIP_Bool initial, SCIP_Bool separate, SCIP_Bool enforce, SCIP_Bool check, SCIP_Bool propagate, SCIP_Bool local, SCIP_Bool modifiable, SCIP_Bool dynamic, SCIP_Bool removable, SCIP_Bool stickingatnode)

SCIP_RETCODE SCIPcopy(SCIP *sourcescip, SCIP *targetscip, SCIP_HASHMAP *varmap, SCIP_HASHMAP *consmap, const char *suffix, SCIP_Bool global, SCIP_Bool enablepricing, SCIP_Bool threadsafe, SCIP_Bool passmessagehdlr, SCIP_Bool *valid)

SCIP_RETCODE SCIPcheckCopyLimits(SCIP *sourcescip, SCIP_Bool *success)

SCIP_RETCODE SCIPtranslateSubSol(SCIP *scip, SCIP *subscip, SCIP_SOL *subsol, SCIP_HEUR *heur, SCIP_VAR **subvars, SCIP_SOL **newsol)

SCIP_RETCODE SCIPcopyLimits(SCIP *sourcescip, SCIP *targetscip)

SCIP_Bool SCIPisStopped(SCIP *scip)

SCIP_RETCODE SCIPfree(SCIP **scip)

SCIP_RETCODE SCIPcreate(SCIP **scip)

int SCIPgetNObjVars(SCIP *scip)

SCIP_RETCODE SCIPgetVarsData(SCIP *scip, SCIP_VAR ***vars, int *nvars, int *nbinvars, int *nintvars, int *nimplvars, int *ncontvars)

SCIP_RETCODE SCIPaddCons(SCIP *scip, SCIP_CONS *cons)

void SCIPhashmapFree(SCIP_HASHMAP **hashmap)

void * SCIPhashmapGetImage(SCIP_HASHMAP *hashmap, void *origin)

SCIP_RETCODE SCIPhashmapCreate(SCIP_HASHMAP **hashmap, BMS_BLKMEM *blkmem, int mapsize)

SCIP_RETCODE SCIPapplyZeroobj(SCIP *scip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_Real minimprove, SCIP_Longint nnodes)

SCIP_RETCODE SCIPaddLongintParam(SCIP *scip, const char *name, const char *desc, SCIP_Longint *valueptr, SCIP_Bool isadvanced, SCIP_Longint defaultvalue, SCIP_Longint minvalue, SCIP_Longint maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_Bool SCIPisParamFixed(SCIP *scip, const char *name)

SCIP_RETCODE SCIPsetLongintParam(SCIP *scip, const char *name, SCIP_Longint value)

SCIP_RETCODE SCIPaddRealParam(SCIP *scip, const char *name, const char *desc, SCIP_Real *valueptr, SCIP_Bool isadvanced, SCIP_Real defaultvalue, SCIP_Real minvalue, SCIP_Real maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

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

SCIP_RETCODE SCIPsetSubscipsOff(SCIP *scip, SCIP_Bool quiet)

SCIP_RETCODE SCIPsetPresolving(SCIP *scip, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

SCIP_RETCODE SCIPaddBoolParam(SCIP *scip, const char *name, const char *desc, SCIP_Bool *valueptr, SCIP_Bool isadvanced, SCIP_Bool defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_RETCODE SCIPsetBoolParam(SCIP *scip, const char *name, SCIP_Bool value)

SCIP_RETCODE SCIPsetSeparating(SCIP *scip, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

SCIP_RETCODE SCIPincludeHeurZeroobj(SCIP *scip)

SCIP_BRANCHRULE * SCIPfindBranchrule(SCIP *scip, const char *name)

SCIP_RETCODE SCIPreleaseCons(SCIP *scip, SCIP_CONS **cons)

SCIP_RETCODE SCIPincludeEventhdlrBasic(SCIP *scip, SCIP_EVENTHDLR **eventhdlrptr, const char *name, const char *desc, SCIP_DECL_EVENTEXEC((*eventexec)), SCIP_EVENTHDLRDATA *eventhdlrdata)

const char * SCIPeventhdlrGetName(SCIP_EVENTHDLR *eventhdlr)

SCIP_EVENTTYPE SCIPeventGetType(SCIP_EVENT *event)

SCIP_RETCODE SCIPcatchEvent(SCIP *scip, SCIP_EVENTTYPE eventtype, SCIP_EVENTHDLR *eventhdlr, SCIP_EVENTDATA *eventdata, int *filterpos)

SCIP_RETCODE SCIPdropEvent(SCIP *scip, SCIP_EVENTTYPE eventtype, SCIP_EVENTHDLR *eventhdlr, SCIP_EVENTDATA *eventdata, int filterpos)

SCIP_RETCODE SCIPsetHeurCopy(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEURCOPY((*heurcopy)))

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_Longint SCIPheurGetNBestSolsFound(SCIP_HEUR *heur)

SCIP_Longint SCIPheurGetNCalls(SCIP_HEUR *heur)

SCIP_RETCODE SCIPsetHeurInit(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEURINIT((*heurinit)))

const char * SCIPheurGetName(SCIP_HEUR *heur)

void SCIPheurSetData(SCIP_HEUR *heur, SCIP_HEURDATA *heurdata)

SCIP_LPSOLSTAT SCIPgetLPSolstat(SCIP *scip)

#define SCIPallocBufferArray(scip, ptr, num)

#define SCIPfreeBufferArray(scip, ptr)

#define SCIPfreeBlockMemory(scip, ptr)

#define SCIPallocBlockMemory(scip, ptr)

SCIP_NODESEL * SCIPfindNodesel(SCIP *scip, const char *name)

int SCIPgetNSols(SCIP *scip)

SCIP_SOL ** SCIPgetSols(SCIP *scip)

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_RETCODE SCIPtransformProb(SCIP *scip)

SCIP_RETCODE SCIPinterruptSolve(SCIP *scip)

SCIP_RETCODE SCIPsolve(SCIP *scip)

SCIP_Longint SCIPgetNSolsFound(SCIP *scip)

SCIP_Real SCIPgetUpperbound(SCIP *scip)

SCIP_Longint SCIPgetNNodes(SCIP *scip)

SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)

SCIP_Real SCIPgetLowerbound(SCIP *scip)

SCIP_Longint SCIPgetNLPIterations(SCIP *scip)

SCIP_Real SCIPinfinity(SCIP *scip)

SCIP_Bool SCIPisFeasZero(SCIP *scip, SCIP_Real val)

SCIP_Bool SCIPisInfinity(SCIP *scip, SCIP_Real val)

SCIP_Real SCIPfeastol(SCIP *scip)

SCIP_Real SCIPsumepsilon(SCIP *scip)

int SCIPgetDepth(SCIP *scip)

SCIP_Real SCIPvarGetObj(SCIP_VAR *var)

SCIP_Real SCIPvarGetUbGlobal(SCIP_VAR *var)

SCIP_RETCODE SCIPchgVarLbGlobal(SCIP *scip, SCIP_VAR *var, SCIP_Real newbound)

SCIP_RETCODE SCIPchgVarUbGlobal(SCIP *scip, SCIP_VAR *var, SCIP_Real newbound)

SCIP_Real SCIPvarGetLbGlobal(SCIP_VAR *var)

SCIP_RETCODE SCIPchgVarObj(SCIP *scip, SCIP_VAR *var, SCIP_Real newobj)

#define DEFAULT_ONLYWITHOUTSOL

#define DEFAULT_NODESQUOT

static SCIP_DECL_HEURFREE(heurFreeZeroobj)

#define DEFAULT_ADDALLSOLS

static SCIP_RETCODE setupAndSolveSubscip(SCIP *scip, SCIP *subscip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_Real minimprove, SCIP_Longint nnodes)

static SCIP_DECL_HEURCOPY(heurCopyZeroobj)

#define DEFAULT_MINIMPROVE

static SCIP_DECL_HEURINIT(heurInitZeroobj)

static SCIP_DECL_EVENTEXEC(eventExecZeroobj)

#define DEFAULT_MAXLPITERS

static SCIP_DECL_HEUREXEC(heurExecZeroobj)

heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "H...

memory allocation routines

BMS_BLKMEM * SCIPblkmem(SCIP *scip)

public methods for managing events

public methods for primal heuristics

public methods for message output

public data structures and miscellaneous methods

public methods for problem variables

public methods for branching rule plugins and branching

public methods for constraint handler plugins and constraints

public methods for problem copies

public methods for event handler plugins and event handlers

public methods for primal heuristic plugins and divesets

public methods for the LP relaxation, rows and columns

public methods for memory management

public methods for message handling

public methods for node selector plugins

public methods for numerical tolerances

public methods for SCIP parameter handling

public methods for global and local (sub)problems

public methods for solutions

public methods for querying solving statistics

public methods for the branch-and-bound tree

public methods for SCIP variables

struct SCIP_EventData SCIP_EVENTDATA

#define SCIP_EVENTTYPE_NODESOLVED

struct SCIP_HeurData SCIP_HEURDATA

@ SCIP_LPSOLSTAT_ITERLIMIT

enum SCIP_Result SCIP_RESULT

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