scip_solvingstats.h
Go to the documentation of this file.
38/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
107/** add given number to the number of processed nodes in current run and in all runs, including the focus node
384 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm
420/** gets total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
422 * @return the total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
434/** gets total number of iterations used in primal and dual simplex and barrier algorithm for the first LP at the root
437 * @return the total number of iterations used in primal and dual simplex and barrier algorithm for the first root LP
547/** gets total number of simplex iterations used so far in primal and dual simplex calls where an advanced start basis
550 * @return the total number of simplex iterations used so far in primal and dual simplex calls where an advanced start
563/** gets total number of primal LPs solved so far that were resolved from an advanced start basis
565 * @return the total number of primal LPs solved so far that were resolved from an advanced start basis
577/** gets total number of simplex iterations used so far in primal simplex calls where an advanced start basis
580 * @return the total number of simplex iterations used so far in primal simplex calls where an advanced start
595 * @return the total number of dual LPs solved so far that were resolved from an advanced start basis
607/** gets total number of simplex iterations used so far in dual simplex calls where an advanced start basis
610 * @return the total number of simplex iterations used so far in dual simplex calls where an advanced start
721/** gets total number of times, strong branching was called (each call represents solving two LPs)
723 * @return the total number of times, strong branching was called (each call represents solving two LPs)
749/** gets total number of times, strong branching was called at the root node (each call represents solving two LPs)
751 * @return the total number of times, strong branching was called at the root node (each call represents solving two LPs)
765 * @return the total number of simplex iterations used so far in strong branching at the root node
843/** 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
885/** get total number of constraints found in conflict analysis (conflict, reconvergence constraints, and dual proofs)
887 * @return the total number of constraints found in conflict analysis (conflict, reconvergence constraints, and dual proofs)
986/** gets maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
988 * @return the maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
1026/** gets total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
1028 * @return the total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
1230/** gets lower (dual) bound in transformed problem obtained by the first LP solve at the root node
1232 * @return the lower (dual) bound in transformed problem obtained by first LP solve at the root node
1257/** gets global primal bound (objective value of best solution or user objective limit) for the original problem
1259 * @return the global primal bound (objective value of best solution or user objective limit) for the original problem
1277/** gets global primal bound (objective value of best solution or user objective limit) for the original problem
1296/** gets global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1298 * @return the global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1316/** gets global exact upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
1335/** gets global cutoff bound in transformed problem: a sub problem with lower bound larger than the cutoff
1336 * cannot contain a better feasible solution; usually, this bound is equal to the upper bound, but if the
1337 * objective value is always integral, the cutoff bound is (nearly) one less than the upper bound;
1338 * additionally, due to objective function domain propagation, the cutoff bound can be further reduced
1358/** gets global cutoff bound of exact transformed problem: a sub problem with lower bound larger than the cutoff
1359 * cannot contain a better feasible solution; usually, this bound is equal to the upper bound, but if the
1360 * objective value is always integral, the cutoff bound is (nearly) one less than the upper bound;
1361 * additionally, due to objective function domain propagation, the cutoff bound can be further reduced
1383 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
1386 * @note using this method in the solving stage can lead to an erroneous SCIP solving status; in particular,
1387 * if a solution not respecting the cutoff bound was found before installing a cutoff bound which
1406/** returns whether the current primal bound is justified with a feasible primal solution; if not, the primal bound
1409 * @return TRUE if the current primal bound is justified with a feasible primal solution, otherwise FALSE
1427/** gets current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1430 * @return the current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
1446/** gets current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1449 * @return current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
1505/** gets number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1507 * @return the number of feasible primal solutions found so far, that improved the primal bound at the time they were found
1572 * @return the average number of pseudo cost updates for the given direction over all variables,
1600/** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1602 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5
1613/** gets the average discounted pseudo cost score value over all variables, assuming a fractionality of 0.5
1617 * @return the average discounted pseudo cost score value over all variables, assuming a fractionality of 0.5,
1645/** gets the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1648 * @return the average pseudo cost score value over all variables, assuming a fractionality of 0.5,
1673/** gets the average conflict score value over all variables, only using the conflict score information of the current run
1675 * @return the average conflict score value over all variables, only using the conflict score information of the current run
1699/** gets the average conflictlength score value over all variables, only using the conflictlength information of the
1702 * @return the average conflictlength score value over all variables, only using the conflictlength information of the
1714/** returns the average number of inferences found after branching in given direction over all variables
1716 * @return the average number of inferences found after branching in given direction over all variables
1728/** returns the average number of inferences found after branching in given direction over all variables,
1731 * @return the average number of inferences found after branching in given direction over all variables,
1757/** gets the average inference score value over all variables, only using the inference information of the
1760 * @return the average inference score value over all variables, only using the inference information of the
1772/** returns the average number of cutoffs found after branching in given direction over all variables
1774 * @return the average number of cutoffs found after branching in given direction over all variables
1786/** returns the average number of cutoffs found after branching in given direction over all variables,
1789 * @return the average number of cutoffs found after branching in given direction over all variables,
1815/** gets the average cutoff score value over all variables, only using the cutoff score information of the current run
1817 * @return the average cutoff score value over all variables, only using the cutoff score information of the current run
1870 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
1896 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
2210 * - ViaPoolApp: The number of cuts that entered the sepastore from the cutpool that were applied to the LP.
2211 * - DirectApp: The number of cuts that entered the sepastore directly and were applied to the LP.
2213 * The number of cuts ViaPoolAdd + Directly should be equal to the number of cuts Filtered + Forced + Selected in the
2216 * @note The following edge case may lead to over or undercounting of statistics: When SCIPapplyCutsProbing() is
2217 * called, cuts are counted for the cut selection statistics, but not for the separator statistics. This
2652 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2655 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
2677 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2680 * @note If limits have been changed between the solution and the call to this function, the status is recomputed and
2702 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2724 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2746 * This function collects detailed branching statistics for all variables in the SCIP instance and organizes them into
2747 * a hierarchical structure in the provided `SCIP_DATATREE`. The statistics include locks, branchings, inferences,
2771 * - `total_branchings_down`: Total number of branchings in the down direction across all variables.
2772 * - `total_branchings_up`: Total number of branchings in the up direction across all variables.
2774 * - `avg_inferences_down`: Average inferences per branching in the down direction across all variables.
2775 * - `avg_inferences_up`: Average inferences per branching in the up direction across all variables.
2776 * - `avg_cutoff_rate_down`: Average cutoff rate for branchings in the down direction across all variables.
2777 * - `avg_cutoff_rate_up`: Average cutoff rate for branchings in the up direction across all variables.
2778 * - `status`: If the problem is not solved, a string indicating that statistics are not available.
2801 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
2811 SCIP_VERBLEVEL verblevel, /**< minimal verbosity level to actually display the information line */
2815/** gets total number of implications between variables that are stored in the implication graph
2817 * @return the total number of implications between variables that are stored in the implication graph
common defines and data types used in all packages of SCIP
void SCIPprintPropagatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3180
void SCIPprintTreeStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4707
void SCIPprintStatusStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2583
SCIP_Real SCIPgetAvgConflictScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2274
SCIP_RETCODE SCIPcollectTimingStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:5503
SCIP_RATIONAL * SCIPgetCutoffboundExact(SCIP *scip)
Definition: scip_solvingstats.c:1817
void SCIPprintCompressionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4175
SCIP_Real SCIPgetAvgCutoffsCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2453
void SCIPprintRootStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5327
SCIP_RETCODE SCIPcollectRelaxatorStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:4658
SCIP_Longint SCIPgetNConflictDualproofsApplied(SCIP *scip)
Definition: scip_solvingstats.c:1257
void SCIPprintConstraintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3073
void SCIPincAvgGMIeff(SCIP *scip, SCIP_Real gmieff)
Definition: scip_solvingstats.c:2515
SCIP_RETCODE SCIPcollectCutselectorStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3724
SCIP_Real SCIPgetDeterministicTime(SCIP *scip)
Definition: scip_solvingstats.c:2552
SCIP_RETCODE SCIPcollectNLPIStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:5772
SCIP_RETCODE SCIPupdateCutoffbound(SCIP *scip, SCIP_Real cutoffbound)
Definition: scip_solvingstats.c:1845
SCIP_Longint SCIPgetNBarrierLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:674
void SCIPgetUpperboundExact(SCIP *scip, SCIP_RATIONAL *result)
Definition: scip_solvingstats.c:1759
SCIP_Real SCIPgetAvgInferenceScore(SCIP *scip)
Definition: scip_solvingstats.c:2385
SCIP_RETCODE SCIPcollectStatusStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:2618
SCIP_Longint SCIPgetNDivingLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:914
SCIP_Real SCIPgetAvgPseudocostScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2226
SCIP_RETCODE SCIPcollectConstraintStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3018
SCIP_RETCODE SCIPcollectHeuristicStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:4061
SCIP_Real SCIPgetLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1607
SCIP_Real SCIPgetAvgConflictlengthScore(SCIP *scip)
Definition: scip_solvingstats.c:2299
void SCIPprintSolutionStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4821
SCIP_RETCODE SCIPcollectBendersStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:5258
SCIP_Real SCIPgetAvgPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2081
SCIP_Longint SCIPgetNInfeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:295
void SCIPprintRelaxatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4621
SCIP_RETCODE SCIPcollectNLPStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:4580
SCIP_Longint SCIPgetNResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:712
void SCIPprintOrigProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2644
SCIP_Longint SCIPgetNNodeZeroIterationLPs(SCIP *scip)
Definition: scip_solvingstats.c:824
SCIP_Longint SCIPgetNFeasibleLeaves(SCIP *scip)
Definition: scip_solvingstats.c:268
SCIP_RETCODE SCIPcollectConflictStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3430
SCIP_Longint SCIPgetNResConflictConssApplied(SCIP *scip)
Definition: scip_solvingstats.c:1234
SCIP_RETCODE SCIPcollectSeparatorStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3583
void SCIPprintLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4254
SCIP_Longint SCIPgetNRootStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:968
SCIP_RETCODE SCIPprintStatisticsJson(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5863
void SCIPprintNLPStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:4549
SCIP_Real SCIPgetFirstPrimalBound(SCIP *scip)
Definition: scip_solvingstats.c:1665
void SCIPgetDualboundExact(SCIP *scip, SCIP_RATIONAL *result)
Definition: scip_solvingstats.c:1454
SCIP_Longint SCIPgetNStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:950
int SCIPgetNPricevarsApplied(SCIP *scip)
Definition: scip_solvingstats.c:1056
SCIP_RETCODE SCIPcollectTreeStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:4749
void SCIPprintPricerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3773
SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5927
SCIP_RETCODE SCIPcollectOrigProblemStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:2670
SCIP_RETCODE SCIPcollectBranchruleStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3891
SCIP_RETCODE SCIPcollectPricerStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3806
SCIP_RETCODE SCIPprintBranchingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:6061
void SCIPprintSeparatorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3504
void SCIPprintConcsolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5105
SCIP_RETCODE SCIPcollectRootStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:5381
void SCIPgetPrimalboundExact(SCIP *scip, SCIP_RATIONAL *result)
Definition: scip_solvingstats.c:1709
void SCIPprintNLPIStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5662
SCIP_Longint SCIPgetNNodeLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:842
SCIP_Longint SCIPgetNDualLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:638
void SCIPprintBranchruleStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3856
void SCIPprintConflictStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3291
SCIP_Real SCIPgetAvgCutoffScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2494
void SCIPprintExpressionHandlerStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5556
void SCIPprintBendersStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5201
void SCIPprintTimingStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5434
SCIP_Longint SCIPgetNRootLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:547
SCIP_Longint SCIPgetNPrimalResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:750
SCIP_Real SCIPgetAvgInferenceScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2410
void SCIPprintCutselectorStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3688
SCIP_RETCODE SCIPcollectExpressionHandlerStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:5604
SCIP_Real SCIPgetAvgConflictScore(SCIP *scip)
Definition: scip_solvingstats.c:2249
SCIP_Longint SCIPgetNLimSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:1999
SCIP_Real SCIPgetAvgPseudocost(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:2043
int SCIPgetNRootIntFixingsRun(SCIP *scip)
Definition: scip_solvingstats.c:403
SCIP_RETCODE SCIPcollectCompressionStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:4207
void SCIPprintConstraintStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2969
SCIP_RETCODE SCIPprintReoptStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:5980
SCIP_Longint SCIPgetNDualResolveLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:788
SCIP_Longint SCIPgetNBestSolsFound(SCIP *scip)
Definition: scip_solvingstats.c:2026
SCIP_Real SCIPgetAvgPseudocostScore(SCIP *scip)
Definition: scip_solvingstats.c:2121
SCIP_Real SCIPgetPseudocostCount(SCIP *scip, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:2200
SCIP_Real SCIPgetFirstLPLowerboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1649
SCIP_Real SCIPgetAvgPseudocostCountCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2102
SCIP_Longint SCIPgetNConflictConssApplied(SCIP *scip)
Definition: scip_solvingstats.c:1210
SCIP_Longint SCIPgetNObjlimLeaves(SCIP *scip)
Definition: scip_solvingstats.c:322
SCIP_RETCODE SCIPcollectPropagatorStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3233
void SCIPprintPresolverStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2745
SCIP_RETCODE SCIPcollectPresolverStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:2853
void SCIPprintTransProblemStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:2697
SCIP_RETCODE SCIPprintDisplayLine(SCIP *scip, FILE *file, SCIP_VERBLEVEL verblevel, SCIP_Bool endline)
Definition: scip_solvingstats.c:6339
SCIP_Real SCIPgetFirstLPDualboundRoot(SCIP *scip)
Definition: scip_solvingstats.c:1628
SCIP_Real SCIPgetAvgConflictlengthScoreCurrentRun(SCIP *scip)
Definition: scip_solvingstats.c:2324
SCIP_Longint SCIPgetNRootFirstLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:566
void SCIPgetLowerboundExact(SCIP *scip, SCIP_RATIONAL *result)
Definition: scip_solvingstats.c:1543
SCIP_Longint SCIPgetNNodeInitLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:878
SCIP_Longint SCIPgetNDelayedCutoffs(SCIP *scip)
Definition: scip_solvingstats.c:430
SCIP_Longint SCIPgetNPrimalResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:730
SCIP_Longint SCIPgetNConflictConssFound(SCIP *scip)
Definition: scip_solvingstats.c:1150
SCIP_Real SCIPgetAvgDPseudocostScore(SCIP *scip, SCIP_Real discountfac)
Definition: scip_solvingstats.c:2147
SCIP_Real SCIPgetAvgPseudocostCurrentRun(SCIP *scip, SCIP_Real solvaldelta)
Definition: scip_solvingstats.c:2063
SCIP_Real SCIPgetAvgInferences(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2347
SCIP_Longint SCIPgetNPrimalLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:602
SCIP_Longint SCIPgetNStrongbranchs(SCIP *scip)
Definition: scip_solvingstats.c:932
SCIP_RETCODE SCIPcollectLPStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:4425
SCIP_RETCODE SCIPcollectConcsolverStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:5149
SCIP_RETCODE SCIPcollectBranchingStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:6217
int SCIPgetNConflictConssFoundNode(SCIP *scip)
Definition: scip_solvingstats.c:1186
SCIP_Longint SCIPgetNLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:503
SCIP_RETCODE SCIPcollectConstraintTimingStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:3124
SCIP_Real SCIPgetAvgInferencesCurrentRun(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2367
SCIP_Longint SCIPgetNDualResolveLPs(SCIP *scip)
Definition: scip_solvingstats.c:768
void SCIPprintHeuristicStatistics(SCIP *scip, FILE *file)
Definition: scip_solvingstats.c:3941
SCIP_Real SCIPgetPseudocostVariance(SCIP *scip, SCIP_BRANCHDIR branchdir, SCIP_Bool onlycurrentrun)
Definition: scip_solvingstats.c:2175
SCIP_Real SCIPgetPrimalDualIntegral(SCIP *scip)
Definition: scip_solvingstats.c:6401
SCIP_RETCODE SCIPcollectTransProblemStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:2714
SCIP_Real SCIPgetAvgCutoffs(SCIP *scip, SCIP_BRANCHDIR dir)
Definition: scip_solvingstats.c:2433
SCIP_Longint SCIPgetNRootStrongbranchLPIterations(SCIP *scip)
Definition: scip_solvingstats.c:986
SCIP_RETCODE SCIPcollectSolutionStatistics(SCIP *scip, SCIP_DATATREE *datatree)
Definition: scip_solvingstats.c:5030
SCIP_Real SCIPgetAvgCutoffScore(SCIP *scip)
Definition: scip_solvingstats.c:2471
Definition: multiprecision.hpp:66
Definition: struct_datatree.h:74
Definition: struct_rational.h:47
Definition: struct_scip.h:72
type definitions for data tree
type definitions for branching and inference history
type definitions for message output methods
type definitions for rational numbers
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure