struct_heur.h
Go to the documentation of this file.
31 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
53 SCIP_Longint totalnbacktracks; /**< the total number of backtracks during the execution of this dive set */
56 SCIP_Longint nconflictsfound; /**< the total number of added conflicts during the execution of this dive set */
76 SCIP_Real maxlpiterquot; /**< maximal fraction of diving LP iterations compared to node LP iterations */
77 SCIP_Real maxdiveubquot; /**< maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound)
79 SCIP_Real maxdiveavgquot; /**< maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound)
81 SCIP_Real maxdiveubquotnosol; /**< maximal UBQUOT when no solution was found yet (0.0: no limit) */
82 SCIP_Real maxdiveavgquotnosol;/**< maximal AVGQUOT when no solution was found yet (0.0: no limit) */
83 SCIP_Real lpresolvedomchgquot;/**< percentage of immediate domain changes during probing to trigger LP resolve */
88 SCIP_Bool onlylpbranchcands; /**< should only LP branching candidates be considered instead of the slower but
90 SCIP_Bool ispublic; /**< is this dive set publicly available (ie., can be used by other primal heuristics?) */
91 SCIP_DIVETYPE divetypemask; /**< bit mask that represents the supported dive types by this dive set */
92 SCIP_DECL_DIVESETGETSCORE((*divesetgetscore)); /**< method for candidate score and rounding direction */
93 SCIP_DECL_DIVESETAVAILABLE((*divesetavailable)); /**< callback to check availability of dive set at the current stage, or NULL if always available */
100 SCIP_Longint nsolsfound; /**< number of feasible primal solutions found so far by this heuristic */
101 SCIP_Longint nbestsolsfound; /**< number of new best primal CIP solutions found so far by this heuristic */
104 SCIP_DECL_HEURCOPY ((*heurcopy)); /**< copy method of primal heuristic or NULL if you don't want to copy your plugin into sub-SCIPs */
108 SCIP_DECL_HEURINITSOL ((*heurinitsol)); /**< solving process initialization method of primal heuristic */
109 SCIP_DECL_HEUREXITSOL ((*heurexitsol)); /**< solving process deinitialization method of primal heuristic */
121 SCIP_HEURTIMING timingmask; /**< positions in the node solving loop where heuristic should be executed */
129 * the variable graph internally stores a mapping from the variables to the constraints in which they appear.
136 SCIP_HASHTABLE* visitedconss; /**< hash table that keeps a record of visited constraints during breadth-first search */
Definition: struct_misc.h:268
Definition: struct_sol.h:73
Definition: struct_cons.h:46
type definitions for primal heuristics
Definition: struct_heur.h:97
Definition: struct_heur.h:46
Definition: struct_heur.h:67
type definitions for clocks and timing issues
Definition: struct_misc.h:89
Definition: struct_heur.h:133
common defines and data types used in all packages of SCIP
Definition: struct_clock.h:64