struct_stat.h
Go to the documentation of this file.
37/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
61 SCIP_REGRESSION* regressioncandsobjval;/**< linear regression of pairs (nbranchcands, lpobjval) for every node */
64 SCIP_Longint nrootfirstlpiterations;/**< number of LP iterations for first LP solved at the root node */
69 SCIP_Longint nprimalresolvelpiterations; /**< number of primal LP iterations with advanced start basis */
70 SCIP_Longint ndualresolvelpiterations; /**< number of dual LP iterations with advanced start basis */
71 SCIP_Longint nlexdualresolvelpiterations; /**< number of lexicographic dual LP iterations with advanced start basis */
72 SCIP_Longint nnodelpiterations; /**< number of iterations for totally solving node relaxations */
73 SCIP_Longint ninitlpiterations; /**< number of iterations for solving nodes' initial relaxations */
76 SCIP_Longint nsbdivinglpiterations;/**< number of iterations in probing mode for strong branching */
78 SCIP_Longint nrootsblpiterations;/**< number of simplex iterations used in strong branching at the root node */
79 SCIP_Longint nconflictlpiterations;/**< number of simplex iterations used in conflict analysis */
81 SCIP_Longint nresolveinstablelpiters; /**< number of simplex iterations used for resolving instable LPs */
83 SCIP_Longint ninternalnodes; /**< number of nodes processed in current run where a branching was performed */
85 SCIP_Longint nfeasleaves; /**< number of leaf nodes processed with feasible relaxation solution */
87 SCIP_Longint ntotalnodes; /**< total number of nodes processed in all runs (including focus node) */
88 SCIP_Longint ntotalinternalnodes;/**< total number of nodes processed in all runs where a branching was performed */
89 SCIP_Longint ntotalnodesmerged; /**< total number of nodes added ot the statistics of the main SCIP so far (see SCIPmergeStatistics) */
94 SCIP_Longint nearlybacktracks; /**< counter for early switches (if children dual bound is below reference value) */
95 SCIP_Longint nnodesaboverefbound;/**< counter for the number of focus nodes exceeding the reference bound */
97 SCIP_Longint ndelayedcutoffs; /**< number of times, the selected node was from a cut off subtree */
104 SCIP_Longint nsbsolsfound; /**< number of CIP-feasible solutions found during strong branching so far */
105 SCIP_Longint nlpbestsolsfound; /**< number of new best CIP-feasible LP solutions found so far */
106 SCIP_Longint nrelaxbestsolsfound;/**< number of new best CIP-feasible relaxation solutions found so far */
107 SCIP_Longint npsbestsolsfound; /**< number of new best CIP-feasible pseudo solutions found so far */
108 SCIP_Longint nsbbestsolsfound; /**< number of new best CIP-feasible solutions found during strong branching so far */
109 SCIP_Longint nexternalsolsfound; /**< number of externally given CIP-feasible solutions (or new solutions found when transforming old ones) */
117 SCIP_Longint nprobboundchgs; /**< total number of bound changes generated in the tree during probing */
118 SCIP_Longint nprobholechgs; /**< total number of hole changes generated in the tree during probing */
119 SCIP_Longint nsbdowndomchgs; /**< total number of domain changes generated at down children during strong branching */
120 SCIP_Longint nsbupdomchgs; /**< total number of domain changes generated at up children during strong branching */
121 SCIP_Longint nsbtimesiterlimhit; /**< total number of times that the strong branching iteration limit was hit */
123 SCIP_Longint ninitconssadded; /**< total number of initial constraints added during the solve */
126 SCIP_Longint exprlastvisitedtag; /**< last used visited tag; used by expression iterators to identify expression that have been visited already */
127 SCIP_Longint exprlastsoltag; /**< last solution tag; used by expression evaluation to identify whether expression has been evaluated for given sol already */
128 SCIP_Longint exprlastdifftag; /**< last differentiation tag; used by expression differentiation to identify whether expression has been differentiated for given sol already */
130 SCIP_Real firstlpdualbound; /**< dual bound of root node computed by first LP solve (without cuts) */
151 SCIP_Real lastprimalbound; /**< last (non-infinite) primal bound (in transformed space) for integral evaluation */
152 SCIP_Real lastdualbound; /**< last (non-infinite) dual bound (in transformed space) for integral evaluation */
153 SCIP_Real lastlowerbound; /**< last lower bound (in transformed space) for integral evaluation */
154 SCIP_Real lastupperbound; /**< last upper bound (in transformed space) for integral evaluation */
155 SCIP_Real rootlpbestestimate; /**< best-estimate for final root LP solution that changes with every pseudo-cost update */
160 SCIP_CLOCK* solvingtime; /**< total time used for solving (including presolving) the current problem */
161 SCIP_CLOCK* solvingtimeoverall; /**< total time used for solving (including presolving) during reoptimization */
175 SCIP_CLOCK* sbsoltime; /**< time needed for searching and storing feasible strong branching solutions */
180 SCIP_CLOCK* reoptupdatetime; /**< time needed for storing and recreating nodes and solutions for reoptimization */
182 SCIP_HISTORY* glbhistorycrun; /**< global history information over all variables for current run */
188 SCIP_LPSOLSTAT lastsblpsolstats[2];/**< last LP solving statuses for variable strong branching */
190 SCIP_Longint lpcount; /**< internal counter, where all lp calls are counted; this includes the restored lps after diving and probing */
201 SCIP_Longint nprimalresolvelps; /**< number of primal LPs solved with advanced start basis and at least 1 iteration */
202 SCIP_Longint ndualresolvelps; /**< number of dual LPs solved with advanced start basis and at least 1 iteration */
203 SCIP_Longint nlexdualresolvelps; /**< number of lexicographic dual LPs solved with advanced start basis and at least 1 iteration */
205 SCIP_Longint nnodezeroitlps; /**< number of LPs solved with 0 iterations for node relaxations */
210 SCIP_Longint nnumtroublelpmsgs; /**< number of messages about numerical trouble in LP on verblevel HIGH or lower */
223 int nrootboundchgsrun; /**< total number of bound changes generated in the root node of current run */
225 int nrootintfixingsrun; /**< total number of global fixings of integer variables of current run */
238 int plungedepth; /**< current plunging depth (successive times, a child was selected as next node) */
258 int lastnpresolchgvartypes;/**< number of presolving variable type changes before presolving round */
261 int lastnpresoldelconss;/**< number of presolving constraint deletions before presolving round */
262 int lastnpresoladdconss;/**< number of presolving constraint additions before presolving round */
263 int lastnpresolupgdconss;/**< number of presolving constraint upgrades before presolving round */
264 int lastnpresolchgcoefs;/**< number of presolving coefficient changes before presolving round */
275 int nclockskipsleft; /**< how many times the timing should be skipped in SCIPsolveIsStopped() */
283 SCIP_Bool branchedunbdvar; /**< indicates whether branching on an unbounded variable has been performed */
common defines and data types used in all packages of SCIP
Definition: struct_clock.h:65
Definition: struct_heur.h:98
Definition: struct_history.h:46
Definition: struct_misc.h:255
Definition: struct_stat.h:60
SCIP_Longint nlexdualresolvelpiterations
Definition: struct_stat.h:71
SCIP_Longint ndualresolvelpiterations
Definition: struct_stat.h:70
SCIP_Longint nprimalresolvelpiterations
Definition: struct_stat.h:69
Definition: struct_var.h:208
Definition: struct_visual.h:50
type definitions for clocks and timing issues
type definitions for primal heuristics
type definitions for branching and inference history
type definitions for LP management
type definitions for miscellaneous datastructures
type definitions for relaxators
type definitions for problem statistics
type definitions for problem variables
type definitions for output for visualization tools (VBC, BAK)