pub_heur.h File Reference Detailed Descriptionpublic methods for primal heuristics Definition in file pub_heur.h. Go to the source code of this file. Function Documentation
compares two heuristics w. r. to their priority
comparison method for sorting heuristics w.r.t. to their name
gets user data of primal heuristic
sets user data of primal heuristic; user has to free old data in advance!
gets name of primal heuristic
gets description of primal heuristic
gets display character of primal heuristic
returns the timing mask of the heuristic
sets new timing mask for heuristic
does the heuristic use a secondary SCIP instance?
gets priority of primal heuristic
gets frequency of primal heuristic
sets frequency of primal heuristic
gets frequency offset of primal heuristic
gets maximal depth level for calling primal heuristic (returns -1, if no depth limit exists)
gets the number of times, the heuristic was called and tried to find a solution
gets the number of primal feasible solutions found by this heuristic
gets the number of new best primal feasible solutions found by this heuristic
is primal heuristic initialized?
gets time in seconds used in this heuristic for setting up for next stages
gets time in seconds used in this heuristic
returns array of divesets of this primal heuristic, or NULL if it has no divesets
returns the number of divesets of this primal heuristic
get the heuristic to which this diving setting belongs
get the working solution of this dive set
set the working solution for this dive set
get the name of the dive set
get the minimum relative depth of the diving settings
get the maximum relative depth of the diving settings
get the number of successful runs of the diving settings
get the number of calls to this dive set
get the number of calls successfully terminated at a feasible leaf node
get the minimum depth reached by this dive set
get the maximum depth reached by this dive set
get the average depth this dive set reached during execution
get the minimum depth at which this dive set found a solution
get the maximum depth at which this dive set found a solution
get the average depth at which this dive set found a solution
get the total number of LP iterations used by this dive set
get the total number of probing nodes used by this dive set
get the total number of backtracks performed by this dive set
get the maximum LP iterations quotient of the diving settings
get the maximum LP iterations offset of the diving settings
get the maximum upper bound quotient parameter of the diving settings if no solution is available
get the average quotient parameter of the diving settings if no solution is available
get the maximum upper bound quotient parameter of the diving settings if an incumbent solution exists
get the average upper bound quotient parameter of the diving settings if an incumbent solution exists
should backtracking be applied?
returns the LP solve frequency for diving LPs (0: dynamically based on number of intermediate domain reductions)
returns the domain reduction quotient for triggering an immediate resolve of the diving LP (0.0: always resolve)
should only LP branching candidates be considered instead of the slower but more general constraint handler diving variable selection?
returns TRUE if dive set supports diving of the specified type
|