scip_solvingstats.h
Go to the documentation of this file.
38 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
105 /** add given number to the number of processed nodes in current run and in all runs, including the focus node
334 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm
336 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm
372 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
374 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
386 /** gets total number of iterations used in primal and dual simplex and barrier algorithm for the first LP at the root
389 * @return the total number of iterations used in primal and dual simplex and barrier algorithm for the first root LP
499 /** gets total number of simplex iterations used so far in primal and dual simplex calls where an advanced start basis
502 * @return the total number of simplex iterations used so far in primal and dual simplex calls where an advanced start
515 /** gets total number of primal LPs solved so far that were resolved from an advanced start basis
517 * @return the total number of primal LPs solved so far that were resolved from an advanced start basis
529 /** gets total number of simplex iterations used so far in primal simplex calls where an advanced start basis
532 * @return the total number of simplex iterations used so far in primal simplex calls where an advanced start
547 * @return the total number of dual LPs solved so far that were resolved from an advanced start basis
559 /** gets total number of simplex iterations used so far in dual simplex calls where an advanced start basis
562 * @return the total number of simplex iterations used so far in dual simplex calls where an advanced start
673 /** gets total number of times, strong branching was called (each call represents solving two LPs)
675 * @return the total number of times, strong branching was called (each call represents solving two LPs)
701 /** gets total number of times, strong branching was called at the root node (each call represents solving two LPs)
703 * @return the total number of times, strong branching was called at the root node (each call represents solving two LPs)
717 * @return the total number of simplex iterations used so far in strong branching at the root node
795 /** get total number of cuts found so far; this includes global cuts from the cut pool as often as they are separated
837 /** get total number of constraints found in conflict analysis (conflict and reconvergence constraints)
839 * @return the total number of constraints found in conflict analysis (conflict and reconvergence constraints)
917 /** gets maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
919 * @return the maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
957 /** gets total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
959 * @return the total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
1115 /** gets lower (dual) bound in transformed problem obtained by the first LP solve at the root node
1117 * @return the lower (dual) bound in transformed problem obtained by first LP solve at the root node
1139 /** gets global primal bound (objective value of best solution or user objective limit) for the original problem
1141 * @return the global primal bound (objective value of best solution or user objective limit) for the original problem
1159 /** gets global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1161 * @return the global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1179 /** gets global cutoff bound in transformed problem: a sub problem with lower bound larger than the cutoff
1180 * cannot contain a better feasible solution; usually, this bound is equal to the upper bound, but if the
1181 * objective value is always integral, the cutoff bound is (nearly) one less than the upper bound;
1182 * additionally, due to objective function domain propagation, the cutoff bound can be further reduced
1204 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1207 * @note using this method in the solving stage can lead to an erroneous SCIP solving status; in particular,
1208 * if a solution not respecting the cutoff bound was found before installing a cutoff bound which
1226 /** returns whether the current primal bound is justified with a feasible primal solution; if not, the primal bound
1229 * @return TRUE if the current primal bound is justified with a feasible primal solution, otherwise FALSE
1247 /** gets current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1250 * @return the current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1263 /** gets current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1266 * @return current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1322 /** gets number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1324 * @return the number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1389 * @return the average number of pseudo cost updates for the given direction over all variables,
1417 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1419 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1445 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1448 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1466 /** gets the average conflict score value over all variables, only using the conflict information of the current run
1468 * @return the average conflict score value over all variables, only using the conflict information of the current run
1492 /** gets the average conflictlength score value over all variables, only using the conflictlength information of the
1495 * @return the average conflictlength score value over all variables, only using the conflictlength information of the
1507 /** returns the average number of inferences found after branching in given direction over all variables
1509 * @return the average number of inferences found after branching in given direction over all variables
1521 /** returns the average number of inferences found after branching in given direction over all variables,
1524 * @return the average number of inferences found after branching in given direction over all variables,
1550 /** gets the average inference score value over all variables, only using the inference information of the
1553 * @return the average inference score value over all variables, only using the inference information of the
1565 /** returns the average number of cutoffs found after branching in given direction over all variables
1567 * @return the average number of cutoffs found after branching in given direction over all variables
1579 /** returns the average number of cutoffs found after branching in given direction over all variables,
1582 * @return the average number of cutoffs found after branching in given direction over all variables,
1608 /** gets the average cutoff score value over all variables, only using the cutoff information of the current run
1610 * @return the average cutoff score value over all variables, only using the cutoff information of the current run
1662 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1689 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1714 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
1882 * - ViaPoolApp: The number of cuts that entered the sepastore from the cutpool that were applied to the LP.
1883 * - DirectApp: The number of cuts that entered the sepastore directly and were applied to the LP.
1885 * The number of cuts ViaPoolAdd + Directly should be equal to the number of cuts Filtered + Forced + Selected in the
1888 * @note The following edge case may lead to over or undercounting of statistics: When SCIPapplyCutsProbing() is
1889 * called, cuts are counted for the cut selection statistics, but not for the separator statistics. This
2110 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2113 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
2135 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2157 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2179 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2189 SCIP_VERBLEVEL verblevel, /**< minimal verbosity level to actually display the information line */
2193 /** gets total number of implications between variables that are stored in the implication graph
2195 * @return the total number of implications between variables that are stored in the implication graph
2211 /** stores conflict graph of binary variables' implications into a file, which can be used as input for the DOT tool
2213 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
SCIP_RETCODE SCIPprintReoptStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4239
SCIP_Real SCIPgetAvgPseudocostCountCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1869
SCIP_Real SCIPgetFirstPrimalBound(SCIP *scip)
Definition: scip_solvingstats.c:1508
SCIP_Longint SCIPgetNRootLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:490
void SCIPprintSeparatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2988
SCIP_Real SCIPgetAvgPseudocostScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:1962
void SCIPprintConstraintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2656
SCIP_Real SCIPgetFirstLPLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1495
SCIP_Longint SCIPgetNLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:446
Definition: struct_scip.h:69
void SCIPincAvgGMIeff(SCIP *scip, SCIP_Real gmieff)
Definition: scip_solvingstats.c:2251
SCIP_RETCODE SCIPupdateCutoffbound(SCIP *scip, SCIP_Real cutoffbound)
Definition: scip_solvingstats.c:1612
void SCIPprintConcsolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3800
SCIP_Real SCIPgetAvgCutoffScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2230
SCIP_Longint SCIPgetNConflictDualproofsApplied(SCIP *scip)
Definition: scip_solvingstats.c:1176
SCIP_Real SCIPgetAvgConflictScore(SCIP *scip)
Definition: scip_solvingstats.c:1985
SCIP_RETCODE SCIPprintTransProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2415
void SCIPprintStatusStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2458
SCIP_RETCODE SCIPprintDisplayLine(SCIP *scip, FILE *file, SCIP_VERBLEVEL verblevel, SCIP_Bool endline)
Definition: scip_solvingstats.c:4435
SCIP_Longint SCIPgetNPrimalResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:673
void SCIPprintBendersStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3844
void SCIPprintTransProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2511
void SCIPprintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3971
SCIP_Real SCIPgetDeterministicTime(SCIP *scip)
Definition: scip_solvingstats.c:2288
SCIP_Longint SCIPgetNStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:875
void SCIPprintHeuristicStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3197
SCIP_Longint SCIPgetNRootFirstLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:509
SCIP_Longint SCIPgetNRootStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:929
SCIP_Longint SCIPgetNDivingLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:857
void SCIPprintPresolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2538
type definitions for return codes for SCIP methods
void SCIPprintBranchruleStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3154
SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4186
SCIP_Real SCIPgetAvgCutoffs(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2169
SCIP_Real SCIPgetLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1450
SCIP_RETCODE SCIPprintBranchingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4320
SCIP_Longint SCIPgetNDualResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:731
SCIP_Real SCIPgetFirstLPDualboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1474
SCIP_Real SCIPgetPrimalDualIntegral(SCIP *scip)
Definition: scip_solvingstats.c:4521
type definitions for SCIP's main datastructure
SCIP_Longint SCIPgetNResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:655
void SCIPprintConflictStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2839
void SCIPprintCompressionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3317
void SCIPprintLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3354
SCIP_Longint SCIPgetNDelayedCutoffs(SCIP *scip)
Definition: scip_solvingstats.c:400
SCIP_RETCODE SCIPprintOrigProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2371
void SCIPprintPropagatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2776
SCIP_Real SCIPgetAvgPseudocostCurrentRun(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1830
SCIP_Longint SCIPgetNBarrierLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:617
SCIP_Longint SCIPgetNPrimalResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:693
void SCIPprintRootStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3906
SCIP_Longint SCIPgetNNodeLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:785
SCIP_Real SCIPgetAvgInferencesCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2103
void SCIPprintRelaxatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3506
void SCIPprintTreeStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3548
void SCIPprintSolutionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3598
SCIP_Real SCIPgetPseudocostVariance(SCIP *scip, SCIP_BRANCHDIR branchdir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1911
SCIP_Real SCIPgetAvgConflictlengthScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2060
void SCIPprintExpressionHandlerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4033
SCIP_RETCODE SCIPwriteImplicationConflictGraph(SCIP *scip, const char *filename)
Definition: scip_solvingstats.c:4493
SCIP_Longint SCIPgetNConflictConssFound(SCIP *scip)
Definition: scip_solvingstats.c:1093
SCIP_Real SCIPgetAvgCutoffsCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2189
void SCIPprintNLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3470
SCIP_Longint SCIPgetNDualResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:711
SCIP_Longint SCIPgetNDualLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:581
SCIP_Longint SCIPgetNConflictConssApplied(SCIP *scip)
Definition: scip_solvingstats.c:1152
SCIP_Longint SCIPgetNObjlimLeaves(SCIP *scip)
Definition: scip_solvingstats.c:319
void SCIPprintNLPIStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4092
void SCIPprintPricerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3116
SCIP_Real SCIPgetAvgCutoffScore(SCIP *scip)
Definition: scip_solvingstats.c:2207
SCIP_Longint SCIPgetNNodeInitLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:821
SCIP_Real SCIPgetAvgConflictlengthScore(SCIP *scip)
Definition: scip_solvingstats.c:2035
SCIP_Longint SCIPgetNStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:893
void SCIPprintCutselectorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3075
SCIP_Longint SCIPgetNPrimalLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:545
SCIP_Real SCIPgetAvgPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1848
SCIP_Real SCIPgetAvgInferenceScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2146
SCIP_Longint SCIPgetNBestSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1793
type definitions for branching and inference history
void SCIPprintConstraintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2715
int SCIPgetNConflictConssFoundNode(SCIP *scip)
Definition: scip_solvingstats.c:1128
type definitions for message output methods
SCIP_Real SCIPgetAvgPseudocostScore(SCIP *scip)
Definition: scip_solvingstats.c:1888
SCIP_Longint SCIPgetNLimSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1766
SCIP_Real SCIPgetAvgPseudocost(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1810
common defines and data types used in all packages of SCIP
SCIP_Longint SCIPgetNNodeZeroIterationLPs(SCIP *scip)
Definition: scip_solvingstats.c:767
Definition: objbenders.h:43
SCIP_Longint SCIPgetNInfeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:292
SCIP_Real SCIPgetAvgConflictScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2010
void SCIPprintOrigProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2485
SCIP_Longint SCIPgetNFeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:265
SCIP_Longint SCIPgetNRootStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:911
SCIP_Real SCIPgetAvgInferenceScore(SCIP *scip)
Definition: scip_solvingstats.c:2121
SCIP_Real SCIPgetPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1936
SCIP_Real SCIPgetAvgInferences(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2083