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 * @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 added to the sepastore 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, reconvergence constraints, and dual proofs)
839 * @return the total number of constraints found in conflict analysis (conflict, reconvergence constraints, and dual proofs)
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
1124/** gets lower (dual) bound in transformed problem obtained by the first LP solve at the root node
1126 * @return the lower (dual) bound in transformed problem obtained by first LP solve at the root node
1151/** gets global primal bound (objective value of best solution or user objective limit) for the original problem
1153 * @return the global primal bound (objective value of best solution or user objective limit) for the original problem
1171/** gets global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1173 * @return the global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1191/** gets global cutoff bound in transformed problem: a sub problem with lower bound larger than the cutoff
1192 * cannot contain a better feasible solution; usually, this bound is equal to the upper bound, but if the
1193 * objective value is always integral, the cutoff bound is (nearly) one less than the upper bound;
1194 * additionally, due to objective function domain propagation, the cutoff bound can be further reduced
1216 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1219 * @note using this method in the solving stage can lead to an erroneous SCIP solving status; in particular,
1220 * if a solution not respecting the cutoff bound was found before installing a cutoff bound which
1239/** returns whether the current primal bound is justified with a feasible primal solution; if not, the primal bound
1242 * @return TRUE if the current primal bound is justified with a feasible primal solution, otherwise FALSE
1260/** gets current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1263 * @return the current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1279/** gets current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1282 * @return current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1338/** gets number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1340 * @return the number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1405 * @return the average number of pseudo cost updates for the given direction over all variables,
1433/** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1435 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1461/** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1464 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1489/** gets the average conflict score value over all variables, only using the conflict score information of the current run
1491 * @return the average conflict score value over all variables, only using the conflict score information of the current run
1515/** gets the average conflictlength score value over all variables, only using the conflictlength information of the
1518 * @return the average conflictlength score value over all variables, only using the conflictlength information of the
1530/** returns the average number of inferences found after branching in given direction over all variables
1532 * @return the average number of inferences found after branching in given direction over all variables
1544/** returns the average number of inferences found after branching in given direction over all variables,
1547 * @return the average number of inferences found after branching in given direction over all variables,
1573/** gets the average inference score value over all variables, only using the inference information of the
1576 * @return the average inference score value over all variables, only using the inference information of the
1588/** returns the average number of cutoffs found after branching in given direction over all variables
1590 * @return the average number of cutoffs found after branching in given direction over all variables
1602/** returns the average number of cutoffs found after branching in given direction over all variables,
1605 * @return the average number of cutoffs found after branching in given direction over all variables,
1631/** gets the average cutoff score value over all variables, only using the cutoff score information of the current run
1633 * @return the average cutoff score value over all variables, only using the cutoff score information of the current run
1686 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1713 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1738 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
1906 * - ViaPoolApp: The number of cuts that entered the sepastore from the cutpool that were applied to the LP.
1907 * - DirectApp: The number of cuts that entered the sepastore directly and were applied to the LP.
1909 * The number of cuts ViaPoolAdd + Directly should be equal to the number of cuts Filtered + Forced + Selected in the
1912 * @note The following edge case may lead to over or undercounting of statistics: When SCIPapplyCutsProbing() is
1913 * called, cuts are counted for the cut selection statistics, but not for the separator statistics. This
2134 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2137 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
2159 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2181 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2203 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2213 SCIP_VERBLEVEL verblevel, /**< minimal verbosity level to actually display the information line */
2217/** gets total number of implications between variables that are stored in the implication graph
2219 * @return the total number of implications between variables that are stored in the implication graph
2235/** stores conflict graph of binary variables' implications into a file, which can be used as input for the DOT tool
2237 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2251 * @deprecated because binary implications are now stored as cliques, please use SCIPwriteCliqueGraph() instead
common defines and data types used in all packages of SCIP
void SCIPprintPropagatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2773
void SCIPprintTreeStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3545
void SCIPprintStatusStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2455
SCIP_Real SCIPgetAvgConflictScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2007
void SCIPprintCompressionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3314
SCIP_Real SCIPgetAvgCutoffsCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2186
void SCIPprintRootStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3903
SCIP_Longint SCIPgetNConflictDualproofsApplied(SCIP *scip)
Definition: scip_solvingstats.c:1176
void SCIPprintConstraintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2712
void SCIPincAvgGMIeff(SCIP *scip, SCIP_Real gmieff)
Definition: scip_solvingstats.c:2248
SCIP_Real SCIPgetDeterministicTime(SCIP *scip)
Definition: scip_solvingstats.c:2285
SCIP_RETCODE SCIPupdateCutoffbound(SCIP *scip, SCIP_Real cutoffbound)
Definition: scip_solvingstats.c:1609
SCIP_Longint SCIPgetNBarrierLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:617
SCIP_Real SCIPgetAvgInferenceScore(SCIP *scip)
Definition: scip_solvingstats.c:2118
SCIP_Longint SCIPgetNDivingLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:857
SCIP_Real SCIPgetAvgPseudocostScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:1959
SCIP_Real SCIPgetLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1447
SCIP_Real SCIPgetAvgConflictlengthScore(SCIP *scip)
Definition: scip_solvingstats.c:2032
void SCIPprintSolutionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3595
SCIP_Real SCIPgetAvgPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1845
SCIP_Longint SCIPgetNInfeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:292
void SCIPprintRelaxatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3503
SCIP_Longint SCIPgetNResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:655
void SCIPprintOrigProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2482
SCIP_Longint SCIPgetNNodeZeroIterationLPs(SCIP *scip)
Definition: scip_solvingstats.c:767
SCIP_Longint SCIPgetNFeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:265
void SCIPprintLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3351
SCIP_Longint SCIPgetNRootStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:911
void SCIPprintNLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3467
SCIP_Real SCIPgetFirstPrimalBound(SCIP *scip)
Definition: scip_solvingstats.c:1505
SCIP_Longint SCIPgetNStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:893
void SCIPprintPricerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3113
SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4183
SCIP_RETCODE SCIPprintBranchingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4317
void SCIPprintSeparatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2985
void SCIPprintConcsolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3797
void SCIPprintNLPIStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4089
SCIP_Longint SCIPgetNNodeLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:785
SCIP_Longint SCIPgetNDualLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:581
void SCIPprintBranchruleStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3151
void SCIPprintConflictStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2836
SCIP_Real SCIPgetAvgCutoffScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2227
void SCIPprintExpressionHandlerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4030
void SCIPprintBendersStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3841
void SCIPprintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3968
SCIP_Longint SCIPgetNRootLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:490
SCIP_Longint SCIPgetNPrimalResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:693
SCIP_Real SCIPgetAvgInferenceScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2143
void SCIPprintCutselectorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3072
SCIP_Real SCIPgetAvgConflictScore(SCIP *scip)
Definition: scip_solvingstats.c:1982
SCIP_Longint SCIPgetNLimSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1763
SCIP_Real SCIPgetAvgPseudocost(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1807
void SCIPprintConstraintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2653
SCIP_RETCODE SCIPprintTransProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2412
SCIP_RETCODE SCIPprintReoptStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4236
SCIP_RETCODE SCIPprintOrigProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2368
SCIP_Longint SCIPgetNDualResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:731
SCIP_Longint SCIPgetNBestSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1790
SCIP_RETCODE SCIPwriteImplicationConflictGraph(SCIP *scip, const char *filename)
Definition: scip_solvingstats.c:4489
SCIP_Real SCIPgetAvgPseudocostScore(SCIP *scip)
Definition: scip_solvingstats.c:1885
SCIP_Real SCIPgetPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1933
SCIP_Real SCIPgetFirstLPLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1489
SCIP_Real SCIPgetAvgPseudocostCountCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1866
SCIP_Longint SCIPgetNConflictConssApplied(SCIP *scip)
Definition: scip_solvingstats.c:1152
SCIP_Longint SCIPgetNObjlimLeaves(SCIP *scip)
Definition: scip_solvingstats.c:319
void SCIPprintPresolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2535
void SCIPprintTransProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2508
SCIP_RETCODE SCIPprintDisplayLine(SCIP *scip, FILE *file, SCIP_VERBLEVEL verblevel, SCIP_Bool endline)
Definition: scip_solvingstats.c:4432
SCIP_Real SCIPgetFirstLPDualboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1468
SCIP_Real SCIPgetAvgConflictlengthScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2057
SCIP_Longint SCIPgetNRootFirstLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:509
SCIP_Longint SCIPgetNNodeInitLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:821
SCIP_Longint SCIPgetNDelayedCutoffs(SCIP *scip)
Definition: scip_solvingstats.c:400
SCIP_Longint SCIPgetNPrimalResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:673
SCIP_Longint SCIPgetNConflictConssFound(SCIP *scip)
Definition: scip_solvingstats.c:1093
SCIP_Real SCIPgetAvgPseudocostCurrentRun(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1827
SCIP_Real SCIPgetAvgInferences(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2080
SCIP_Longint SCIPgetNPrimalLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:545
SCIP_Longint SCIPgetNStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:875
int SCIPgetNConflictConssFoundNode(SCIP *scip)
Definition: scip_solvingstats.c:1128
SCIP_Longint SCIPgetNLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:446
SCIP_Real SCIPgetAvgInferencesCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2100
SCIP_Longint SCIPgetNDualResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:711
void SCIPprintHeuristicStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3194
SCIP_Real SCIPgetPseudocostVariance(SCIP *scip, SCIP_BRANCHDIR branchdir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1908
SCIP_Real SCIPgetPrimalDualIntegral(SCIP *scip)
Definition: scip_solvingstats.c:4523
SCIP_Real SCIPgetAvgCutoffs(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2166
SCIP_Longint SCIPgetNRootStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:929
SCIP_Real SCIPgetAvgCutoffScore(SCIP *scip)
Definition: scip_solvingstats.c:2204
Definition: objbenders.h:44
Definition: struct_scip.h:70
type definitions for branching and inference history
type definitions for message output methods
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure