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
336 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm
338 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm
374 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
376 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
388 /** gets total number of iterations used in primal and dual simplex and barrier algorithm for the first LP at the root
391 * @return the total number of iterations used in primal and dual simplex and barrier algorithm for the first root LP
501 /** gets total number of simplex iterations used so far in primal and dual simplex calls where an advanced start basis
504 * @return the total number of simplex iterations used so far in primal and dual simplex calls where an advanced start
517 /** gets total number of primal LPs solved so far that were resolved from an advanced start basis
519 * @return the total number of primal LPs solved so far that were resolved from an advanced start basis
531 /** gets total number of simplex iterations used so far in primal simplex calls where an advanced start basis
534 * @return the total number of simplex iterations used so far in primal simplex calls where an advanced start
549 * @return the total number of dual LPs solved so far that were resolved from an advanced start basis
561 /** gets total number of simplex iterations used so far in dual simplex calls where an advanced start basis
564 * @return the total number of simplex iterations used so far in dual simplex calls where an advanced start
675 /** gets total number of times, strong branching was called (each call represents solving two LPs)
677 * @return the total number of times, strong branching was called (each call represents solving two LPs)
703 /** gets total number of times, strong branching was called at the root node (each call represents solving two LPs)
705 * @return the total number of times, strong branching was called at the root node (each call represents solving two LPs)
719 * @return the total number of simplex iterations used so far in strong branching at the root node
797 /** get total number of cuts found so far; this includes global cuts from the cut pool as often as they are separated
839 /** get total number of constraints found in conflict analysis (conflict and reconvergence constraints)
841 * @return the total number of constraints found in conflict analysis (conflict and reconvergence constraints)
919 /** gets maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
921 * @return the maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
959 /** gets total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
961 * @return the total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
1117 /** gets lower (dual) bound in transformed problem obtained by the first LP solve at the root node
1119 * @return the lower (dual) bound in transformed problem obtained by first LP solve at the root node
1141 /** gets global primal bound (objective value of best solution or user objective limit) for the original problem
1143 * @return the global primal bound (objective value of best solution or user objective limit) for the original problem
1161 /** gets global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1163 * @return the global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1181 /** gets global cutoff bound in transformed problem: a sub problem with lower bound larger than the cutoff
1182 * cannot contain a better feasible solution; usually, this bound is equal to the upper bound, but if the
1183 * objective value is always integral, the cutoff bound is (nearly) one less than the upper bound;
1184 * additionally, due to objective function domain propagation, the cutoff bound can be further reduced
1206 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1209 * @note using this method in the solving stage can lead to an erroneous SCIP solving status; in particular,
1210 * if a solution not respecting the cutoff bound was found before installing a cutoff bound which
1228 /** returns whether the current primal bound is justified with a feasible primal solution; if not, the primal bound
1231 * @return TRUE if the current primal bound is justified with a feasible primal solution, otherwise FALSE
1249 /** gets current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1252 * @return the current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1265 /** gets current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1268 * @return current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1324 /** gets number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1326 * @return the number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1391 * @return the average number of pseudo cost updates for the given direction over all variables,
1419 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1421 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1447 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1450 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1468 /** gets the average conflict score value over all variables, only using the conflict information of the current run
1470 * @return the average conflict score value over all variables, only using the conflict information of the current run
1494 /** gets the average conflictlength score value over all variables, only using the conflictlength information of the
1497 * @return the average conflictlength score value over all variables, only using the conflictlength information of the
1509 /** returns the average number of inferences found after branching in given direction over all variables
1511 * @return the average number of inferences found after branching in given direction over all variables
1523 /** returns the average number of inferences found after branching in given direction over all variables,
1526 * @return the average number of inferences found after branching in given direction over all variables,
1552 /** gets the average inference score value over all variables, only using the inference information of the
1555 * @return the average inference score value over all variables, only using the inference information of the
1567 /** returns the average number of cutoffs found after branching in given direction over all variables
1569 * @return the average number of cutoffs found after branching in given direction over all variables
1581 /** returns the average number of cutoffs found after branching in given direction over all variables,
1584 * @return the average number of cutoffs found after branching in given direction over all variables,
1610 /** gets the average cutoff score value over all variables, only using the cutoff information of the current run
1612 * @return the average cutoff score value over all variables, only using the cutoff information of the current run
1666 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1693 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1718 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
1886 * - ViaPoolApp: The number of cuts that entered the sepastore from the cutpool that were applied to the LP.
1887 * - DirectApp: The number of cuts that entered the sepastore directly and were applied to the LP.
1889 * The number of cuts ViaPoolAdd + Directly should be equal to the number of cuts Filtered + Forced + Selected in the
1892 * @note The following edge case may lead to over or undercounting of statistics: When SCIPapplyCutsProbing() is
1893 * called, cuts are counted for the cut selection statistics, but not for the separator statistics. This
2114 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2117 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
2139 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2161 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2183 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2193 SCIP_VERBLEVEL verblevel, /**< minimal verbosity level to actually display the information line */
2197 /** gets total number of implications between variables that are stored in the implication graph
2199 * @return the total number of implications between variables that are stored in the implication graph
2215 /** stores conflict graph of binary variables' implications into a file, which can be used as input for the DOT tool
2217 * @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:4243
SCIP_Real SCIPgetAvgPseudocostCountCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1871
SCIP_Real SCIPgetFirstPrimalBound(SCIP *scip)
Definition: scip_solvingstats.c:1510
SCIP_Longint SCIPgetNRootLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:492
void SCIPprintSeparatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2992
SCIP_Real SCIPgetAvgPseudocostScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:1964
void SCIPprintConstraintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2660
SCIP_Real SCIPgetFirstLPLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1497
SCIP_Longint SCIPgetNLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:448
Definition: struct_scip.h:69
void SCIPincAvgGMIeff(SCIP *scip, SCIP_Real gmieff)
Definition: scip_solvingstats.c:2255
SCIP_RETCODE SCIPupdateCutoffbound(SCIP *scip, SCIP_Real cutoffbound)
Definition: scip_solvingstats.c:1614
void SCIPprintConcsolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3804
SCIP_Real SCIPgetAvgCutoffScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2232
SCIP_Longint SCIPgetNConflictDualproofsApplied(SCIP *scip)
Definition: scip_solvingstats.c:1178
SCIP_Real SCIPgetAvgConflictScore(SCIP *scip)
Definition: scip_solvingstats.c:1987
SCIP_RETCODE SCIPprintTransProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2419
void SCIPprintStatusStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2462
SCIP_RETCODE SCIPprintDisplayLine(SCIP *scip, FILE *file, SCIP_VERBLEVEL verblevel, SCIP_Bool endline)
Definition: scip_solvingstats.c:4439
SCIP_Longint SCIPgetNPrimalResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:675
void SCIPprintBendersStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3848
void SCIPprintTransProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2515
void SCIPprintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3975
SCIP_Real SCIPgetDeterministicTime(SCIP *scip)
Definition: scip_solvingstats.c:2292
SCIP_Longint SCIPgetNStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:877
void SCIPprintHeuristicStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3201
SCIP_Longint SCIPgetNRootFirstLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:511
SCIP_Longint SCIPgetNRootStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:931
SCIP_Longint SCIPgetNDivingLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:859
void SCIPprintPresolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2542
type definitions for return codes for SCIP methods
void SCIPprintBranchruleStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3158
SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4190
SCIP_Real SCIPgetAvgCutoffs(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2171
SCIP_Real SCIPgetLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1452
SCIP_RETCODE SCIPprintBranchingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4324
SCIP_Longint SCIPgetNDualResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:733
SCIP_Real SCIPgetFirstLPDualboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1476
SCIP_Real SCIPgetPrimalDualIntegral(SCIP *scip)
Definition: scip_solvingstats.c:4525
type definitions for SCIP's main datastructure
SCIP_Longint SCIPgetNResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:657
void SCIPprintConflictStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2843
void SCIPprintCompressionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3321
void SCIPprintLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3358
SCIP_Longint SCIPgetNDelayedCutoffs(SCIP *scip)
Definition: scip_solvingstats.c:402
SCIP_RETCODE SCIPprintOrigProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2375
void SCIPprintPropagatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2780
SCIP_Real SCIPgetAvgPseudocostCurrentRun(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1832
SCIP_Longint SCIPgetNBarrierLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:619
SCIP_Longint SCIPgetNPrimalResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:695
void SCIPprintRootStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3910
SCIP_Longint SCIPgetNNodeLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:787
SCIP_Real SCIPgetAvgInferencesCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2105
void SCIPprintRelaxatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3510
void SCIPprintTreeStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3552
void SCIPprintSolutionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3602
SCIP_Real SCIPgetPseudocostVariance(SCIP *scip, SCIP_BRANCHDIR branchdir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1913
SCIP_Real SCIPgetAvgConflictlengthScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2062
void SCIPprintExpressionHandlerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4037
SCIP_RETCODE SCIPwriteImplicationConflictGraph(SCIP *scip, const char *filename)
Definition: scip_solvingstats.c:4497
SCIP_Longint SCIPgetNConflictConssFound(SCIP *scip)
Definition: scip_solvingstats.c:1095
SCIP_Real SCIPgetAvgCutoffsCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2191
void SCIPprintNLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3474
SCIP_Longint SCIPgetNDualResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:713
SCIP_Longint SCIPgetNDualLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:583
SCIP_Longint SCIPgetNConflictConssApplied(SCIP *scip)
Definition: scip_solvingstats.c:1154
SCIP_Longint SCIPgetNObjlimLeaves(SCIP *scip)
Definition: scip_solvingstats.c:321
void SCIPprintNLPIStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4096
void SCIPprintPricerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3120
SCIP_Real SCIPgetAvgCutoffScore(SCIP *scip)
Definition: scip_solvingstats.c:2209
SCIP_Longint SCIPgetNNodeInitLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:823
SCIP_Real SCIPgetAvgConflictlengthScore(SCIP *scip)
Definition: scip_solvingstats.c:2037
SCIP_Longint SCIPgetNStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:895
void SCIPprintCutselectorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3079
SCIP_Longint SCIPgetNPrimalLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:547
SCIP_Real SCIPgetAvgPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1850
SCIP_Real SCIPgetAvgInferenceScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2148
SCIP_Longint SCIPgetNBestSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1795
type definitions for branching and inference history
void SCIPprintConstraintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2719
int SCIPgetNConflictConssFoundNode(SCIP *scip)
Definition: scip_solvingstats.c:1130
type definitions for message output methods
SCIP_Real SCIPgetAvgPseudocostScore(SCIP *scip)
Definition: scip_solvingstats.c:1890
SCIP_Longint SCIPgetNLimSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1768
int SCIPgetNPricevarsApplied(SCIP *scip)
Definition: scip_solvingstats.c:1001
SCIP_Real SCIPgetAvgPseudocost(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1812
common defines and data types used in all packages of SCIP
SCIP_Longint SCIPgetNNodeZeroIterationLPs(SCIP *scip)
Definition: scip_solvingstats.c:769
Definition: objbenders.h:43
SCIP_Longint SCIPgetNInfeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:294
SCIP_Real SCIPgetAvgConflictScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2012
void SCIPprintOrigProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2489
SCIP_Longint SCIPgetNFeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:267
SCIP_Longint SCIPgetNRootStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:913
SCIP_Real SCIPgetAvgInferenceScore(SCIP *scip)
Definition: scip_solvingstats.c:2123
SCIP_Real SCIPgetPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1938
SCIP_Real SCIPgetAvgInferences(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2085