RetroSearch Browse

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

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

SCIP Doxygen Documentation: heur_bound.c Source File

59#define HEUR_NAME "bound" 60#define HEUR_DESC "heuristic which fixes all integer variables to a bound and solves the remaining LP" 61#define HEUR_DISPCHAR SCIP_HEURDISPCHAR_PROP 62#define HEUR_PRIORITY -1107000 65#define HEUR_MAXDEPTH -1 66#define HEUR_TIMING SCIP_HEURTIMING_BEFORENODE 67#define HEUR_USESSUBSCIP FALSE 69#define DEFAULT_ONLYWITHOUTSOL TRUE 70#define DEFAULT_MAXPROPROUNDS 0 71#define DEFAULT_BOUND 'l' 112

maxproprounds = heurdata->maxproprounds;

113 if

( maxproprounds == -2 )

117

nvars = nbinvars + nintvars;

122 for

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

130 for

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

140 for

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

154 SCIPdebugMsg

(

scip

"fixing %d: variable <%s> to lower bound <%g> (%d pseudo cands)\n"

161 SCIPdebugMsg

(

scip

"fixing %d: variable <%s> to upper bound <%g> (%d pseudo cands)\n"

166 if

( heurdata->maxproprounds != 0 )

177 SCIPdebugMsg

(

scip

"probing ended with %sfeasible problem\n"

, infeasible ?

"in"

""

);

196 if

( nunfixedcols > 0.5 * ncols )

199 "Heuristic " HEUR_NAME " solving LP from scratch with %.1f %% unfixed columns (%d of %d) ...\n"

200

100.0 * (nunfixedcols / (

SCIP_Real

)ncols), nunfixedcols, ncols);

218 SCIPwarningMessage

(

scip

"Error while solving LP in bound heuristic; LP solve terminated with code <%d>\n"

249 SCIPdebugMsg

(

scip

"bound heuristic found roundable primal solution: obj=%g\n"

290

assert(heur !=

NULL

);

320

assert(heur !=

NULL

);

322

assert(result !=

NULL

);

333

assert(heurdata !=

NULL

);

363 if

( heurdata->bound ==

'l'

|| heurdata->bound ==

'b'

)

367 if

( heurdata->bound ==

'u'

|| heurdata->bound ==

'b'

)

395

assert(heur !=

NULL

);

404 "Should heuristic only be executed if no primal solution was found, yet?"

408 "maximum number of propagation rounds during probing (-1 infinity, -2 parameter settings)"

412 "to which bound should integer variables be fixed? ('l'ower, 'u'pper, or 'b'oth)"

internal methods for clocks and timing issues

#define SCIP_LONGINT_FORMAT

SCIP_Bool SCIPisStopped(SCIP *scip)

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

void SCIPverbMessage(SCIP *scip, SCIP_VERBLEVEL msgverblevel, FILE *file, const char *formatstr,...)

void SCIPwarningMessage(SCIP *scip, const char *formatstr,...)

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

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

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

int SCIPgetNPseudoBranchCands(SCIP *scip)

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)))

const char * SCIPheurGetName(SCIP_HEUR *heur)

void SCIPheurSetData(SCIP_HEUR *heur, SCIP_HEURDATA *heurdata)

SCIP_RETCODE SCIPflushLP(SCIP *scip)

SCIP_Bool SCIPhasCurrentNodeLP(SCIP *scip)

SCIP_RETCODE SCIPconstructLP(SCIP *scip, SCIP_Bool *cutoff)

SCIP_Bool SCIPisLPConstructed(SCIP *scip)

SCIP_LPSOLSTAT SCIPgetLPSolstat(SCIP *scip)

int SCIPgetNUnfixedLPCols(SCIP *scip)

int SCIPgetNLPCols(SCIP *scip)

SCIP_Bool SCIPisLPSolBasic(SCIP *scip)

#define SCIPfreeBlockMemory(scip, ptr)

#define SCIPallocBlockMemory(scip, ptr)

SCIP_Longint SCIPnodeGetNumber(SCIP_NODE *node)

char * SCIPsnprintfProbingStats(SCIP *scip, char *strbuf, int len)

SCIP_RETCODE SCIPpropagateProbing(SCIP *scip, int maxproprounds, SCIP_Bool *cutoff, SCIP_Longint *ndomredsfound)

SCIP_RETCODE SCIPstartProbing(SCIP *scip)

SCIP_RETCODE SCIPsolveProbingLP(SCIP *scip, int itlim, SCIP_Bool *lperror, SCIP_Bool *cutoff)

SCIP_RETCODE SCIPfixVarProbing(SCIP *scip, SCIP_VAR *var, SCIP_Real fixedval)

SCIP_RETCODE SCIPendProbing(SCIP *scip)

SCIP_SOL * SCIPgetBestSol(SCIP *scip)

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

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

SCIP_RETCODE SCIProundSol(SCIP *scip, SCIP_SOL *sol, SCIP_Bool *success)

SCIP_RETCODE SCIPtrySol(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 SCIPlinkLPSol(SCIP *scip, SCIP_SOL *sol)

SCIP_Real SCIPgetSolOrigObj(SCIP *scip, SCIP_SOL *sol)

SCIP_Longint SCIPgetNLPIterations(SCIP *scip)

SCIP_Real SCIPgetSolvingTime(SCIP *scip)

SCIP_Bool SCIPisInfinity(SCIP *scip, SCIP_Real val)

SCIP_RETCODE SCIPcutoffNode(SCIP *scip, SCIP_NODE *node)

SCIP_NODE * SCIPgetCurrentNode(SCIP *scip)

SCIP_Real SCIPvarGetUbLocal(SCIP_VAR *var)

SCIP_VARTYPE SCIPvarGetType(SCIP_VAR *var)

const char * SCIPvarGetName(SCIP_VAR *var)

SCIP_Real SCIPvarGetLbLocal(SCIP_VAR *var)

#define DEFAULT_ONLYWITHOUTSOL

static SCIP_DECL_HEURCOPY(heurCopyBound)

static SCIP_DECL_HEUREXEC(heurExecBound)

static SCIP_RETCODE applyBoundHeur(SCIP *scip, SCIP_HEUR *heur, SCIP_HEURDATA *heurdata, SCIP_Bool lower, SCIP_RESULT *result)

static SCIP_DECL_HEURFREE(heurFreeBound)

#define DEFAULT_MAXPROPROUNDS

heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP

public methods for primal heuristics

public methods for message output

public methods for branch and bound tree

public methods for problem variables

public methods for branching rule plugins and branching

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 numerical tolerances

public methods for SCIP parameter handling

public methods for global and local (sub)problems

public methods for the probing mode

public methods for solutions

public methods for querying solving statistics

public methods for timing

public methods for the branch-and-bound tree

struct SCIP_HeurData SCIP_HEURDATA

enum SCIP_LPSolStat SCIP_LPSOLSTAT

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