scip_solvingstats.h
Go to the documentation of this file.
29 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
96 /** add given number to the number of processed nodes in current run and in all runs, including the focus node
327 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm
329 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm
365 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
367 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
379 /** gets total number of iterations used in primal and dual simplex and barrier algorithm for the first LP at the root
382 * @return the total number of iterations used in primal and dual simplex and barrier algorithm for the first root LP
492 /** gets total number of simplex iterations used so far in primal and dual simplex calls where an advanced start basis
495 * @return the total number of simplex iterations used so far in primal and dual simplex calls where an advanced start
508 /** gets total number of primal LPs solved so far that were resolved from an advanced start basis
510 * @return the total number of primal LPs solved so far that were resolved from an advanced start basis
522 /** gets total number of simplex iterations used so far in primal simplex calls where an advanced start basis
525 * @return the total number of simplex iterations used so far in primal simplex calls where an advanced start
540 * @return the total number of dual LPs solved so far that were resolved from an advanced start basis
552 /** gets total number of simplex iterations used so far in dual simplex calls where an advanced start basis
555 * @return the total number of simplex iterations used so far in dual simplex calls where an advanced start
666 /** gets total number of times, strong branching was called (each call represents solving two LPs)
668 * @return the total number of times, strong branching was called (each call represents solving two LPs)
694 /** gets total number of times, strong branching was called at the root node (each call represents solving two LPs)
696 * @return the total number of times, strong branching was called at the root node (each call represents solving two LPs)
710 * @return the total number of simplex iterations used so far in strong branching at the root node
788 /** get total number of cuts found so far; this includes global cuts from the cut pool as often as they are separated
830 /** get total number of constraints found in conflict analysis (conflict and reconvergence constraints)
832 * @return the total number of constraints found in conflict analysis (conflict and reconvergence constraints)
910 /** gets maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
912 * @return the maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
950 /** gets total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
952 * @return the total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
1108 /** gets lower (dual) bound in transformed problem obtained by the first LP solve at the root node
1110 * @return the lower (dual) bound in transformed problem obtained by first LP solve at the root node
1132 /** gets global primal bound (objective value of best solution or user objective limit) for the original problem
1134 * @return the global primal bound (objective value of best solution or user objective limit) for the original problem
1152 /** gets global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1154 * @return the global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1172 /** gets global cutoff bound in transformed problem: a sub problem with lower bound larger than the cutoff
1173 * cannot contain a better feasible solution; usually, this bound is equal to the upper bound, but if the
1174 * objective value is always integral, the cutoff bound is (nearly) one less than the upper bound;
1175 * additionally, due to objective function domain propagation, the cutoff bound can be further reduced
1197 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1200 * @note using this method in the solving stage can lead to an erroneous SCIP solving status; in particular,
1201 * if a solution not respecting the cutoff bound was found before installing a cutoff bound which
1219 /** returns whether the current primal bound is justified with a feasible primal solution; if not, the primal bound
1222 * @return TRUE if the current primal bound is justified with a feasible primal solution, otherwise FALSE
1240 /** gets current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1243 * @return the current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1256 /** gets current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1259 * @return current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1315 /** gets number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1317 * @return the number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1382 * @return the average number of pseudo cost updates for the given direction over all variables,
1410 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1412 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1438 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1441 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1459 /** gets the average conflict score value over all variables, only using the conflict information of the current run
1461 * @return the average conflict score value over all variables, only using the conflict information of the current run
1485 /** gets the average conflictlength score value over all variables, only using the conflictlength information of the
1488 * @return the average conflictlength score value over all variables, only using the conflictlength information of the
1500 /** returns the average number of inferences found after branching in given direction over all variables
1502 * @return the average number of inferences found after branching in given direction over all variables
1514 /** returns the average number of inferences found after branching in given direction over all variables,
1517 * @return the average number of inferences found after branching in given direction over all variables,
1543 /** gets the average inference score value over all variables, only using the inference information of the
1546 * @return the average inference score value over all variables, only using the inference information of the
1558 /** returns the average number of cutoffs found after branching in given direction over all variables
1560 * @return the average number of cutoffs found after branching in given direction over all variables
1572 /** returns the average number of cutoffs found after branching in given direction over all variables,
1575 * @return the average number of cutoffs found after branching in given direction over all variables,
1601 /** gets the average cutoff score value over all variables, only using the cutoff information of the current run
1603 * @return the average cutoff score value over all variables, only using the cutoff information of the current run
1630 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1657 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1682 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
1850 * - ViaPoolApp: The number of cuts that entered the sepastore from the cutpool that were applied to the LP.
1851 * - DirectApp: The number of cuts that entered the sepastore directly and were applied to the LP.
1853 * The number of cuts ViaPoolAdd + Directly should be equal to the number of cuts Filtered + Forced + Selected in the
1856 * @note The following edge case may lead to over or undercounting of statistics: When SCIPapplyCutsProbing() is
1857 * called, cuts are counted for the cut selection statistics, but not for the separator statistics. This
2078 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2081 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
2103 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2125 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2147 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2157 SCIP_VERBLEVEL verblevel, /**< minimal verbosity level to actually display the information line */
2161 /** gets total number of implications between variables that are stored in the implication graph
2163 * @return the total number of implications between variables that are stored in the implication graph
2179 /** stores conflict graph of binary variables' implications into a file, which can be used as input for the DOT tool
2181 * @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:4180
SCIP_Real SCIPgetAvgPseudocostCountCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1861
SCIP_Real SCIPgetFirstPrimalBound(SCIP *scip)
Definition: scip_solvingstats.c:1500
SCIP_Longint SCIPgetNRootLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:482
void SCIPprintSeparatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2947
SCIP_Real SCIPgetAvgPseudocostScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:1954
void SCIPprintConstraintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2615
SCIP_Real SCIPgetFirstLPLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1487
SCIP_Longint SCIPgetNLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:438
Definition: struct_scip.h:59
SCIP_RETCODE SCIPupdateCutoffbound(SCIP *scip, SCIP_Real cutoffbound)
Definition: scip_solvingstats.c:1604
void SCIPprintConcsolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3741
SCIP_Real SCIPgetAvgCutoffScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2222
SCIP_Longint SCIPgetNConflictDualproofsApplied(SCIP *scip)
Definition: scip_solvingstats.c:1168
SCIP_Real SCIPgetAvgConflictScore(SCIP *scip)
Definition: scip_solvingstats.c:1977
SCIP_RETCODE SCIPprintTransProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2374
void SCIPprintStatusStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2417
SCIP_RETCODE SCIPprintDisplayLine(SCIP *scip, FILE *file, SCIP_VERBLEVEL verblevel, SCIP_Bool endline)
Definition: scip_solvingstats.c:4376
SCIP_Longint SCIPgetNPrimalResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:665
void SCIPprintBendersStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3785
void SCIPprintTransProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2470
void SCIPprintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3912
SCIP_Real SCIPgetDeterministicTime(SCIP *scip)
Definition: scip_solvingstats.c:2247
SCIP_Longint SCIPgetNStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:867
void SCIPprintHeuristicStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3157
SCIP_Longint SCIPgetNRootFirstLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:501
SCIP_Longint SCIPgetNRootStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:921
SCIP_Longint SCIPgetNDivingLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:849
void SCIPprintPresolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2497
type definitions for return codes for SCIP methods
void SCIPprintBranchruleStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3114
SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4127
SCIP_Real SCIPgetAvgCutoffs(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2161
SCIP_Real SCIPgetLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1442
SCIP_RETCODE SCIPprintBranchingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4261
SCIP_Longint SCIPgetNDualResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:723
SCIP_Real SCIPgetFirstLPDualboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1466
type definitions for SCIP's main datastructure
SCIP_Longint SCIPgetNResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:647
void SCIPprintConflictStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2798
void SCIPprintCompressionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3268
void SCIPprintLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3305
SCIP_Longint SCIPgetNDelayedCutoffs(SCIP *scip)
Definition: scip_solvingstats.c:392
SCIP_RETCODE SCIPprintOrigProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2330
void SCIPprintPropagatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2735
SCIP_Real SCIPgetAvgPseudocostCurrentRun(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1822
SCIP_Longint SCIPgetNBarrierLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:609
SCIP_Longint SCIPgetNPrimalResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:685
void SCIPprintRootStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3847
SCIP_Longint SCIPgetNNodeLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:777
SCIP_Real SCIPgetAvgInferencesCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2095
void SCIPprintRelaxatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3447
void SCIPprintTreeStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3489
void SCIPprintSolutionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3539
SCIP_Real SCIPgetPseudocostVariance(SCIP *scip, SCIP_BRANCHDIR branchdir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1903
SCIP_Real SCIPgetAvgConflictlengthScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2052
void SCIPprintExpressionHandlerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3974
SCIP_RETCODE SCIPwriteImplicationConflictGraph(SCIP *scip, const char *filename)
Definition: scip_solvingstats.c:4434
SCIP_Longint SCIPgetNConflictConssFound(SCIP *scip)
Definition: scip_solvingstats.c:1085
SCIP_Real SCIPgetAvgCutoffsCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2181
void SCIPprintNLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3421
SCIP_Longint SCIPgetNDualResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:703
SCIP_Longint SCIPgetNDualLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:573
SCIP_Longint SCIPgetNConflictConssApplied(SCIP *scip)
Definition: scip_solvingstats.c:1144
SCIP_Longint SCIPgetNObjlimLeaves(SCIP *scip)
Definition: scip_solvingstats.c:311
void SCIPprintNLPIStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4033
void SCIPprintPricerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3076
SCIP_Real SCIPgetAvgCutoffScore(SCIP *scip)
Definition: scip_solvingstats.c:2199
SCIP_Longint SCIPgetNNodeInitLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:813
SCIP_Real SCIPgetAvgConflictlengthScore(SCIP *scip)
Definition: scip_solvingstats.c:2027
SCIP_Longint SCIPgetNStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:885
void SCIPprintCutselectorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3035
SCIP_Longint SCIPgetNPrimalLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:537
SCIP_Real SCIPgetAvgPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1840
SCIP_Real SCIPgetAvgInferenceScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2138
SCIP_Longint SCIPgetNBestSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1785
type definitions for branching and inference history
void SCIPprintConstraintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2674
int SCIPgetNConflictConssFoundNode(SCIP *scip)
Definition: scip_solvingstats.c:1120
type definitions for message output methods
SCIP_Real SCIPgetAvgPseudocostScore(SCIP *scip)
Definition: scip_solvingstats.c:1880
SCIP_Longint SCIPgetNLimSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1758
SCIP_Real SCIPgetAvgPseudocost(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1802
common defines and data types used in all packages of SCIP
SCIP_Longint SCIPgetNNodeZeroIterationLPs(SCIP *scip)
Definition: scip_solvingstats.c:759
Definition: objbenders.h:33
SCIP_Longint SCIPgetNInfeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:284
SCIP_Real SCIPgetAvgConflictScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2002
void SCIPprintOrigProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2444
SCIP_Longint SCIPgetNFeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:257
SCIP_Longint SCIPgetNRootStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:903
SCIP_Real SCIPgetAvgInferenceScore(SCIP *scip)
Definition: scip_solvingstats.c:2113
SCIP_Real SCIPgetPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1928
SCIP_Real SCIPgetAvgInferences(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2075