scip_solvingstats.h
Go to the documentation of this file.
29 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
115 /** add given number to the number of processed nodes in current run and in all runs, including the focus node
300 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm
302 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm
338 /** gets total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
340 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
352 /** gets total number of iterations used in primal and dual simplex and barrier algorithm for the first LP at the root
355 * @return the total number of iterations used in primal and dual simplex and barrier algorithm for the first root LP
465 /** gets total number of simplex iterations used so far in primal and dual simplex calls where an advanced start basis
468 * @return the total number of simplex iterations used so far in primal and dual simplex calls where an advanced start
481 /** gets total number of primal LPs solved so far that were resolved from an advanced start basis
483 * @return the total number of primal LPs solved so far that were resolved from an advanced start basis
495 /** gets total number of simplex iterations used so far in primal simplex calls where an advanced start basis
498 * @return the total number of simplex iterations used so far in primal simplex calls where an advanced start
513 * @return the total number of dual LPs solved so far that were resolved from an advanced start basis
525 /** gets total number of simplex iterations used so far in dual simplex calls where an advanced start basis
528 * @return the total number of simplex iterations used so far in dual simplex calls where an advanced start
625 /** gets total number of times, strong branching was called (each call represents solving two LPs)
627 * @return the total number of times, strong branching was called (each call represents solving two LPs)
653 /** gets total number of times, strong branching was called at the root node (each call represents solving two LPs)
655 * @return the total number of times, strong branching was called at the root node (each call represents solving two LPs)
669 * @return the total number of simplex iterations used so far in strong branching at the root node
789 /** get total number of constraints found in conflict analysis (conflict and reconvergence constraints)
791 * @return the total number of constraints found in conflict analysis (conflict and reconvergence constraints)
849 /** gets maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
851 * @return the maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
889 /** gets total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
891 * @return the total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
1047 /** gets lower (dual) bound in transformed problem obtained by the first LP solve at the root node
1049 * @return the lower (dual) bound in transformed problem obtained by first LP solve at the root node
1071 /** gets global primal bound (objective value of best solution or user objective limit) for the original problem
1073 * @return the global primal bound (objective value of best solution or user objective limit) for the original problem
1091 /** gets global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1093 * @return the global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1111 /** gets global cutoff bound in transformed problem: a sub problem with lower bound larger than the cutoff
1112 * cannot contain a better feasible solution; usually, this bound is equal to the upper bound, but if the
1113 * objective value is always integral, the cutoff bound is (nearly) one less than the upper bound;
1114 * additionally, due to objective function domain propagation, the cutoff bound can be further reduced
1136 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1139 * @note using this method in the solving stage can lead to an erroneous SCIP solving status; in particular,
1140 * if a solution not respecting the cutoff bound was found before installing a cutoff bound which
1158 /** returns whether the current primal bound is justified with a feasible primal solution; if not, the primal bound
1161 * @return TRUE if the current primal bound is justified with a feasible primal solution, otherwise FALSE
1179 /** gets current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1182 * @return the current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1195 /** gets current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1198 * @return current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1254 /** gets number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1256 * @return the number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1321 * @return the average number of pseudo cost updates for the given direction over all variables,
1349 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1351 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1377 /** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1380 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1398 /** gets the average conflict score value over all variables, only using the conflict information of the current run
1400 * @return the average conflict score value over all variables, only using the conflict information of the current run
1424 /** gets the average conflictlength score value over all variables, only using the conflictlength information of the
1427 * @return the average conflictlength score value over all variables, only using the conflictlength information of the
1439 /** returns the average number of inferences found after branching in given direction over all variables
1441 * @return the average number of inferences found after branching in given direction over all variables
1453 /** returns the average number of inferences found after branching in given direction over all variables,
1456 * @return the average number of inferences found after branching in given direction over all variables,
1482 /** gets the average inference score value over all variables, only using the inference information of the
1485 * @return the average inference score value over all variables, only using the inference information of the
1497 /** returns the average number of cutoffs found after branching in given direction over all variables
1499 * @return the average number of cutoffs found after branching in given direction over all variables
1511 /** returns the average number of cutoffs found after branching in given direction over all variables,
1514 * @return the average number of cutoffs found after branching in given direction over all variables,
1540 /** gets the average cutoff score value over all variables, only using the cutoff information of the current run
1542 * @return the average cutoff score value over all variables, only using the cutoff information of the current run
1569 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1596 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1621 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
1952 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1955 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
1977 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1999 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2021 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2031 SCIP_VERBLEVEL verblevel, /**< minimal verbosity level to actually display the information line */
2035 /** gets total number of implications between variables that are stored in the implication graph
2037 * @return the total number of implications between variables that are stored in the implication graph
2053 /** stores conflict graph of binary variables' implications into a file, which can be used as input for the DOT tool
2055 * @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:3829
SCIP_Real SCIPgetAvgPseudocostCountCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1809
SCIP_Real SCIPgetFirstPrimalBound(SCIP *scip)
Definition: scip_solvingstats.c:1448
SCIP_Longint SCIPgetNRootLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:480
void SCIPprintSeparatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2877
SCIP_Real SCIPgetAvgPseudocostScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:1902
void SCIPprintConstraintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2561
SCIP_Real SCIPgetFirstLPLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1435
internal methods for branch and bound tree
SCIP_Longint SCIPgetNLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:436
Definition: struct_scip.h:58
SCIP_RETCODE SCIPupdateCutoffbound(SCIP *scip, SCIP_Real cutoffbound)
Definition: scip_solvingstats.c:1552
void SCIPprintConcsolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3532
SCIP_Real SCIPgetAvgCutoffScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2170
SCIP_Real SCIPgetAvgConflictScore(SCIP *scip)
Definition: scip_solvingstats.c:1925
SCIP_RETCODE SCIPprintTransProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2322
void SCIPprintStatusStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2365
SCIP_RETCODE SCIPprintDisplayLine(SCIP *scip, FILE *file, SCIP_VERBLEVEL verblevel, SCIP_Bool endline)
Definition: scip_solvingstats.c:4006
SCIP_Longint SCIPgetNPrimalResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:663
void SCIPprintBendersStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3576
void SCIPprintTransProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2418
void SCIPprintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3700
SCIP_Real SCIPgetDeterministicTime(SCIP *scip)
Definition: scip_solvingstats.c:2195
SCIP_Longint SCIPgetNStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:847
void SCIPprintHeuristicStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3001
SCIP_Longint SCIPgetNRootFirstLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:499
SCIP_Longint SCIPgetNRootStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:901
SCIP_Longint SCIPgetNDivingLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:829
void SCIPprintPresolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2443
type definitions for return codes for SCIP methods
void SCIPprintBranchruleStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2958
SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3776
SCIP_Real SCIPgetAvgCutoffs(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2109
SCIP_Real SCIPgetLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1390
SCIP_RETCODE SCIPprintBranchingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3891
SCIP_Longint SCIPgetNDualResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:721
SCIP_Real SCIPgetFirstLPDualboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1414
type definitions for SCIP's main datastructure
SCIP_Longint SCIPgetNResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:645
void SCIPprintConflictStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2744
void SCIPprintCompressionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3098
void SCIPprintLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3135
SCIP_Longint SCIPgetNDelayedCutoffs(SCIP *scip)
Definition: scip_solvingstats.c:390
internal miscellaneous methods
SCIP_RETCODE SCIPprintOrigProblem(SCIP *scip, FILE *file, const char *extension, SCIP_Bool genericnames)
Definition: scip_solvingstats.c:2278
void SCIPprintPropagatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2681
internal methods for global SCIP settings
SCIP main data structure.
SCIP_Real SCIPgetAvgPseudocostCurrentRun(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1770
SCIP_Longint SCIPgetNBarrierLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:607
SCIP_Longint SCIPgetNPrimalResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:683
void SCIPprintRootStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3635
SCIP_Longint SCIPgetNNodeLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:757
SCIP_Real SCIPgetAvgInferencesCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2043
internal methods for problem variables
void SCIPprintRelaxatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3277
void SCIPprintTreeStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3312
void SCIPprintSolutionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3362
SCIP_Real SCIPgetPseudocostVariance(SCIP *scip, SCIP_BRANCHDIR branchdir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1851
SCIP_Real SCIPgetAvgConflictlengthScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2000
SCIP_RETCODE SCIPwriteImplicationConflictGraph(SCIP *scip, const char *filename)
Definition: scip_solvingstats.c:4064
methods for debugging
SCIP_Longint SCIPgetNConflictConssFound(SCIP *scip)
Definition: scip_solvingstats.c:1065
SCIP_Real SCIPgetAvgCutoffsCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2129
void SCIPprintNLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3251
SCIP_Longint SCIPgetNDualResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:701
SCIP_Longint SCIPgetNDualLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:571
SCIP_Longint SCIPgetNConflictConssApplied(SCIP *scip)
Definition: scip_solvingstats.c:1124
datastructures for problem statistics
SCIP_Longint SCIPgetNObjlimLeaves(SCIP *scip)
Definition: scip_solvingstats.c:362
void SCIPprintPricerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2920
SCIP_Real SCIPgetAvgCutoffScore(SCIP *scip)
Definition: scip_solvingstats.c:2147
SCIP_Longint SCIPgetNNodeInitLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:793
SCIP_Real SCIPgetAvgConflictlengthScore(SCIP *scip)
Definition: scip_solvingstats.c:1975
SCIP_Longint SCIPgetNStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:865
internal methods for main solving loop and node processing
SCIP_Longint SCIPgetNPrimalLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:535
SCIP_Real SCIPgetAvgPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:1788
SCIP_Real SCIPgetAvgInferenceScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2086
SCIP_Longint SCIPgetNBestSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1733
type definitions for branching and inference history
void SCIPprintConstraintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2620
internal methods for constraints and constraint handlers
int SCIPgetNConflictConssFoundNode(SCIP *scip)
Definition: scip_solvingstats.c:1100
type definitions for message output methods
SCIP_Real SCIPgetAvgPseudocostScore(SCIP *scip)
Definition: scip_solvingstats.c:1828
SCIP_Longint SCIPgetNLimSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1706
SCIP_Real SCIPgetAvgPseudocost(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:1750
common defines and data types used in all packages of SCIP
Definition: objbenders.h:33
SCIP_Longint SCIPgetNInfeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:335
SCIP_Real SCIPgetAvgConflictScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:1950
void SCIPprintOrigProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2392
SCIP_Longint SCIPgetNFeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:308
SCIP_Longint SCIPgetNRootStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:883
SCIP_Real SCIPgetAvgInferenceScore(SCIP *scip)
Definition: scip_solvingstats.c:2061
SCIP_Real SCIPgetPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:1876
SCIP_Real SCIPgetAvgInferences(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2023