|
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Detailed DescriptionLP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in. Definition in file heur_actconsdiving.c. #include <assert.h>#include <string.h>#include "scip/heur_actconsdiving.h"#include "scip/pub_dive.h"Go to the source code of this file.
Macro Definition Documentation
Definition at line 29 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
Definition at line 30 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
Definition at line 31 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
Definition at line 32 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
Definition at line 33 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
Definition at line 34 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
Definition at line 35 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
Definition at line 36 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
does the heuristic use a secondary SCIP instance? Definition at line 37 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
bit mask that represents all supported dive types Definition at line 38 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
minimal relative depth to start diving Definition at line 44 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
maximal relative depth to start diving Definition at line 45 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
maximal fraction of diving LP iterations compared to node LP iterations Definition at line 46 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
additional number of allowed LP iterations Definition at line 47 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit) Definition at line 48 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit) Definition at line 51 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
maximal UBQUOT when no solution was found yet (0.0: no limit) Definition at line 54 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
maximal AVGQUOT when no solution was found yet (0.0: no limit) Definition at line 55 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
use one level of backtracking if infeasibility is encountered? Definition at line 56 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
percentage of immediate domain changes during probing to trigger LP resolve Definition at line 57 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
LP solve frequency for diving heuristics Definition at line 58 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving().
should only LP branching candidates be considered instead of the slower but more general constraint handler diving variable selection? Definition at line 59 of file heur_actconsdiving.c. Referenced by SCIPincludeHeurActconsdiving(). Function Documentation
returns a score value for the given variable based on the active constraints that the variable appears in
Definition at line 77 of file heur_actconsdiving.c. References NULL, SCIP_Real, SCIP_VARSTATUS_COLUMN, SCIPcolGetNLPNonz(), SCIPcolGetRows(), SCIPcolGetVals(), SCIPgetBranchScore(), SCIPgetNLPRows(), SCIPgetRowSolActivity(), SCIPisFeasEQ(), SCIPisFeasNegative(), SCIPisFeasPositive(), SCIProwGetDualsol(), SCIProwGetLhs(), SCIProwGetNorm(), SCIProwGetRhs(), SCIPvarGetCol(), and SCIPvarGetStatus().
copy method for primal heuristic plugins (called when SCIP copies plugins) Definition at line 188 of file heur_actconsdiving.c.
destructor of primal heuristic to free user data (called when SCIP is exiting) Definition at line 202 of file heur_actconsdiving.c.
initialization method of primal heuristic (called after problem was transformed) Definition at line 223 of file heur_actconsdiving.c.
deinitialization method of primal heuristic (called before transformed problem is freed) Definition at line 243 of file heur_actconsdiving.c.
execution method of primal heuristic Definition at line 263 of file heur_actconsdiving.c.
calculate score and preferred rounding direction for the candidate variable; the best candidate maximizes the score Definition at line 290 of file heur_actconsdiving.c.
creates the actconsdiving heuristic and includes it in SCIP
Definition at line 338 of file heur_actconsdiving.c. References DEFAULT_BACKTRACK, DEFAULT_LPRESOLVEDOMCHGQUOT, DEFAULT_LPSOLVEFREQ, DEFAULT_MAXDIVEAVGQUOT, DEFAULT_MAXDIVEAVGQUOTNOSOL, DEFAULT_MAXDIVEUBQUOT, DEFAULT_MAXDIVEUBQUOTNOSOL, DEFAULT_MAXLPITEROFS, DEFAULT_MAXLPITERQUOT, DEFAULT_MAXRELDEPTH, DEFAULT_MINRELDEPTH, DEFAULT_ONLYLPBRANCHCANDS, DIVESET_DIVETYPES, HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, HEUR_USESSUBSCIP, NULL, SCIP_CALL, SCIP_OKAY, SCIPallocMemory, SCIPcreateDiveset(), SCIPincludeHeurBasic(), SCIPsetHeurCopy(), SCIPsetHeurExit(), SCIPsetHeurFree(), and SCIPsetHeurInit(). Referenced by SCIPincludeDefaultPlugins(). |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||