|
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Detailed DescriptionLP diving heuristic that chooses fixings w.r.t. the matrix coefficients. Indicator constraints are taken into account if present. Definition in file heur_coefdiving.c. #include <assert.h>#include <string.h>#include "scip/heur_coefdiving.h"#include "scip/pub_dive.h"Go to the source code of this file.
Macro Definition Documentation
Definition at line 32 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
Definition at line 33 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
Definition at line 34 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
Definition at line 35 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
Definition at line 36 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
Definition at line 37 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
Definition at line 38 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
Definition at line 39 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
does the heuristic use a secondary SCIP instance? Definition at line 40 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
bit mask that represents all supported dive types Definition at line 41 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
minimal relative depth to start diving Definition at line 48 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
maximal relative depth to start diving Definition at line 49 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
maximal fraction of diving LP iterations compared to node LP iterations Definition at line 50 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
additional number of allowed LP iterations Definition at line 51 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit) Definition at line 52 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit) Definition at line 55 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
maximal UBQUOT when no solution was found yet (0.0: no limit) Definition at line 58 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
maximal AVGQUOT when no solution was found yet (0.0: no limit) Definition at line 59 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
use one level of backtracking if infeasibility is encountered? Definition at line 60 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
percentage of immediate domain changes during probing to trigger LP resolve Definition at line 61 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
LP solve frequency for diving heuristics Definition at line 62 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving().
should only LP branching candidates be considered instead of the slower but more general constraint handler diving variable selection? Definition at line 63 of file heur_coefdiving.c. Referenced by SCIPincludeHeurCoefdiving(). Function Documentation
copy method for primal heuristic plugins (called when SCIP copies plugins) Definition at line 83 of file heur_coefdiving.c.
destructor of primal heuristic to free user data (called when SCIP is exiting) Definition at line 97 of file heur_coefdiving.c.
initialization method of primal heuristic (called after problem was transformed) Definition at line 117 of file heur_coefdiving.c.
deinitialization method of primal heuristic (called before transformed problem is freed) Definition at line 137 of file heur_coefdiving.c.
execution method of primal heuristic Definition at line 157 of file heur_coefdiving.c.
returns a score for the given candidate – the best candidate maximizes the diving score Definition at line 177 of file heur_coefdiving.c.
creates the coefdiving heuristic and includes it in SCIP
Definition at line 253 of file heur_coefdiving.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(). |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||