SCIP++ refs/heads/main
 
Loading...
Searching...
No Matches
scippp::statistics Namespace Reference

Parameters to access statistics with. More...

Classes

struct  Statistic
 Storage for a function pointer. More...
 

Variables

static const Statistic< SCIP_Real > AVG_CONFLICT_SCORE { &SCIPgetAvgConflictScore }
 average conflict score value over all variables
 
static const Statistic< SCIP_Real > AVG_CONFLICT_SCORE_CURRENT_RUN { &SCIPgetAvgConflictScoreCurrentRun }
 average conflict score value over all variables, only using the conflict information of the current run
 
static const Statistic< SCIP_Real > AVG_CONFLICTLENGTH_SCORE { &SCIPgetAvgConflictlengthScore }
 average inference score value over all variables
 
static const Statistic< SCIP_Real > AVG_CONFLICTLENGTH_SCORE_CURRENT_RUN { &SCIPgetAvgConflictlengthScoreCurrentRun }
 average conflictlength score value over all variables, only using the conflictlength information of the
 
static const Statistic< SCIP_Real > AVG_CUTOFF_SCORE { &SCIPgetAvgCutoffScore }
 average cutoff score value over all variables
 
static const Statistic< SCIP_Real > AVG_CUTOFF_SCORE_CURRENT_RUN { &SCIPgetAvgCutoffScoreCurrentRun }
 average cutoff score value over all variables, only using the cutoff information of the current run
 
static const Statistic< SCIP_Real > AVG_DUALBOUND { &SCIPgetAvgDualbound }
 average dual bound of all unprocessed nodes for original problem
 
static const Statistic< SCIP_Real > AVG_G_M_IEFF { &SCIPgetAvgGMIeff }
 average normalized efficacy of a GMI cut over all variables
 
static const Statistic< SCIP_Real > AVG_INFERENCE_SCORE { &SCIPgetAvgInferenceScore }
 average inference score value over all variables
 
static const Statistic< SCIP_Real > AVG_INFERENCE_SCORE_CURRENT_RUN { &SCIPgetAvgInferenceScoreCurrentRun }
 average inference score value over all variables, only using the inference information of the
 
static const Statistic< SCIP_Real > AVG_LOWERBOUND { &SCIPgetAvgLowerbound }
 average lower (dual) bound of all unprocessed nodes in transformed problem
 
static const Statistic< SCIP_Real > AVG_PSEUDOCOST_SCORE { &SCIPgetAvgPseudocostScore }
 average pseudo cost score value over all variables, assuming a fractionality of 0.5
 
static const Statistic< SCIP_Real > AVG_PSEUDOCOST_SCORE_CURRENT_RUN { &SCIPgetAvgPseudocostScoreCurrentRun }
 average pseudo cost score value over all variables, assuming a fractionality of 0.5,
 
static const Statistic< SCIP_Real > CUTOFFBOUND { &SCIPgetCutoffbound }
 global cutoff bound in transformed problem
 
static const Statistic< SCIP_Real > DETERMINISTIC_TIME { &SCIPgetDeterministicTime }
 total number of LPs solved so far
 
static const Statistic< SCIP_Real > DUALBOUND { &SCIPgetDualbound }
 global dual bound
 
static const Statistic< SCIP_Real > DUALBOUND_ROOT { &SCIPgetDualboundRoot }
 dual bound of the root node for the original problem
 
static const Statistic< SCIP_Real > FIRST_LP_DUALBOUND_ROOT { &SCIPgetFirstLPDualboundRoot }
 dual bound for the original problem of the first LP solve at the root node
 
static const Statistic< SCIP_Real > FIRST_LP_LOWERBOUND_ROOT { &SCIPgetFirstLPLowerboundRoot }
 lower (dual) bound in transformed problem obtained by first LP solve at the root node
 
static const Statistic< SCIP_Real > FIRST_PRIMAL_BOUND { &SCIPgetFirstPrimalBound }
 primal bound of the very first solution
 
static const Statistic< SCIP_Real > GAP { &SCIPgetGap }
 current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,
 
static const Statistic< SCIP_Real > LOWERBOUND { &SCIPgetLowerbound }
 global lower (dual) bound in transformed problem
 
static const Statistic< SCIP_Real > LOWERBOUND_ROOT { &SCIPgetLowerboundRoot }
 lower (dual) bound in transformed problem of the root node
 
static const Statistic< int > MAX_DEPTH { &SCIPgetMaxDepth }
 maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)
 
static const Statistic< int > MAX_TOTAL_DEPTH { &SCIPgetMaxTotalDepth }
 maximal depth of all processed nodes over all branch and bound runs
 
static const Statistic< int > N_ACTIVE_CONSS { &SCIPgetNActiveConss }
 total number of active constraints at the current node
 
static const Statistic< SCIP_Longint > N_BACKTRACKS { &SCIPgetNBacktracks }
 total number of backtracks, i.e. number of times, the new node was selected from the leaves queue
 
static const Statistic< SCIP_Longint > N_BARRIER_L_PS { &SCIPgetNBarrierLPs }
 total number of barrier LPs solved so far
 
static const Statistic< SCIP_Longint > N_BARRIER_LP_ITERATIONS { &SCIPgetNBarrierLPIterations }
 total number of iterations used so far in barrier algorithm
 
static const Statistic< SCIP_Longint > N_BEST_SOLS_FOUND { &SCIPgetNBestSolsFound }
 number of feasible primal solutions found so far, that improved the primal bound at the time they were found
 
static const Statistic< SCIP_Longint > N_CONFLICT_CONSS_APPLIED { &SCIPgetNConflictConssApplied }
 total number of conflict constraints added to the problem
 
static const Statistic< SCIP_Longint > N_CONFLICT_CONSS_FOUND { &SCIPgetNConflictConssFound }
 total number of constraints found in conflict analysis (conflict and reconvergence constraints)
 
static const Statistic< int > N_CONFLICT_CONSS_FOUND_NODE { &SCIPgetNConflictConssFoundNode }
 number of conflict constraints found so far at the current node
 
static const Statistic< SCIP_Longint > N_CONFLICT_DUALPROOFS_APPLIED { &SCIPgetNConflictDualproofsApplied }
 total number of dual proof constraints added to the problem
 
static const Statistic< int > N_CUTS_APPLIED { &SCIPgetNCutsApplied }
 total number of cuts applied to the LPs
 
static const Statistic< int > N_CUTS_FOUND { &SCIPgetNCutsFound }
 total number of cuts found so far
 
static const Statistic< int > N_CUTS_FOUND_ROUND { &SCIPgetNCutsFoundRound }
 number of cuts found so far in current separation round
 
static const Statistic< SCIP_Longint > N_DELAYED_CUTOFFS { &SCIPgetNDelayedCutoffs }
 number of times a selected node was from a cut off subtree
 
static const Statistic< SCIP_Longint > N_DIVING_L_PS { &SCIPgetNDivingLPs }
 total number of LPs solved so far during diving and probing
 
static const Statistic< SCIP_Longint > N_DIVING_LP_ITERATIONS { &SCIPgetNDivingLPIterations }
 total number of simplex iterations used so far during diving and probing
 
static const Statistic< SCIP_Longint > N_DUAL_L_PS { &SCIPgetNDualLPs }
 total number of dual LPs solved so far
 
static const Statistic< SCIP_Longint > N_DUAL_LP_ITERATIONS { &SCIPgetNDualLPIterations }
 total number of iterations used so far in dual simplex
 
static const Statistic< SCIP_Longint > N_DUAL_RESOLVE_L_PS { &SCIPgetNDualResolveLPs }
 total number of dual LPs solved so far that were resolved from an advanced start basis
 
static const Statistic< SCIP_Longint > N_DUAL_RESOLVE_LP_ITERATIONS { &SCIPgetNDualResolveLPIterations }
 total number of simplex iterations used so far in dual simplex calls where an advanced start
 
static const Statistic< int > N_ENABLED_CONSS { &SCIPgetNEnabledConss }
 total number of enabled constraints at the current node
 
static const Statistic< SCIP_Longint > N_FEASIBLE_LEAVES { &SCIPgetNFeasibleLeaves }
 number of leaf nodes processed with feasible relaxation solution
 
static const Statistic< int > N_IMPLICATIONS { &SCIPgetNImplications }
 total number of implications between variables that are stored in the implication graph
 
static const Statistic< SCIP_Longint > N_INFEASIBLE_LEAVES { &SCIPgetNInfeasibleLeaves }
 number of infeasible leaf nodes processed
 
static const Statistic< SCIP_Longint > N_L_PS { &SCIPgetNLPs }
 total number of LPs solved so far
 
static const Statistic< SCIP_Longint > N_LIM_SOLS_FOUND { &SCIPgetNLimSolsFound }
 number of feasible primal solutions respecting the objective limit found so far
 
static const Statistic< SCIP_Longint > N_LP_ITERATIONS { &SCIPgetNLPIterations }
 total number of iterations used so far in primal and dual simplex and barrier algorithm
 
static const Statistic< SCIP_Longint > N_N_ZS { &SCIPgetNNZs }
 number of active non-zeros in the current transformed problem
 
static const Statistic< SCIP_Longint > N_NODE_INIT_L_PS { &SCIPgetNNodeInitLPs }
 total number of LPs solved so far for initial LP in node relaxations
 
static const Statistic< SCIP_Longint > N_NODE_INIT_LP_ITERATIONS { &SCIPgetNNodeInitLPIterations }
 total number of simplex iterations used so far for initial LP in node relaxations
 
static const Statistic< SCIP_Longint > N_NODE_L_PS { &SCIPgetNNodeLPs }
 total number of LPs solved so far for node relaxations
 
static const Statistic< SCIP_Longint > N_NODE_LP_ITERATIONS { &SCIPgetNNodeLPIterations }
 total number of simplex iterations used so far for node relaxations
 
static const Statistic< SCIP_Longint > N_NODE_ZERO_ITERATION_L_PS { &SCIPgetNNodeZeroIterationLPs }
 total number of LPs solved with 0 iteratins for node relaxations
 
static const Statistic< SCIP_Longint > N_NODES { &SCIPgetNNodes }
 number of processed nodes in current run, including the focus node
 
static const Statistic< SCIP_Longint > N_OBJLIM_LEAVES { &SCIPgetNObjlimLeaves }
 number of processed leaf nodes that hit LP objective limit
 
static const Statistic< int > N_PRICE_ROUNDS { &SCIPgetNPriceRounds }
 number of pricing rounds performed so far at the current node
 
static const Statistic< int > N_PRICEVARS { &SCIPgetNPricevars }
 current number of variables in the pricing store
 
static const Statistic< int > N_PRICEVARS_APPLIED { &SCIPgetNPricevarsApplied }
 total number of pricing variables applied to the LPs
 
static const Statistic< int > N_PRICEVARS_FOUND { &SCIPgetNPricevarsFound }
 total number of pricing variables found so far
 
static const Statistic< SCIP_Longint > N_PRIMAL_L_PS { &SCIPgetNPrimalLPs }
 total number of primal LPs solved so far
 
static const Statistic< SCIP_Longint > N_PRIMAL_LP_ITERATIONS { &SCIPgetNPrimalLPIterations }
 total number of iterations used so far in primal simplex
 
static const Statistic< SCIP_Longint > N_PRIMAL_RESOLVE_L_PS { &SCIPgetNPrimalResolveLPs }
 total number of primal LPs solved so far that were resolved from an advanced start basis
 
static const Statistic< SCIP_Longint > N_PRIMAL_RESOLVE_LP_ITERATIONS { &SCIPgetNPrimalResolveLPIterations }
 total number of simplex iterations used so far in primal simplex calls where an advanced start
 
static const Statistic< int > N_REOPT_RUNS { &SCIPgetNReoptRuns }
 number of reoptimization runs performed, including the current run
 
static const Statistic< SCIP_Longint > N_RESOLVE_L_PS { &SCIPgetNResolveLPs }
 total number of LPs solved so far that were resolved from an advanced start basis
 
static const Statistic< SCIP_Longint > N_RESOLVE_LP_ITERATIONS { &SCIPgetNResolveLPIterations }
 total number of simplex iterations used so far in primal and dual simplex calls where an advanced start
 
static const Statistic< SCIP_Longint > N_ROOT_FIRST_LP_ITERATIONS { &SCIPgetNRootFirstLPIterations }
 total number of iterations used in primal and dual simplex and barrier algorithm for the first root LP
 
static const Statistic< SCIP_Longint > N_ROOT_LP_ITERATIONS { &SCIPgetNRootLPIterations }
 total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node
 
static const Statistic< SCIP_Longint > N_ROOT_STRONGBRANCH_LP_ITERATIONS { &SCIPgetNRootStrongbranchLPIterations }
 total number of simplex iterations used so far in strong branching at the root node
 
static const Statistic< SCIP_Longint > N_ROOT_STRONGBRANCHS { &SCIPgetNRootStrongbranchs }
 total number of times, strong branching was called at the root node (each call represents solving two LPs)
 
static const Statistic< int > N_ROOTBOUND_CHGS { &SCIPgetNRootboundChgs }
 number of global bound changes
 
static const Statistic< int > N_ROOTBOUND_CHGS_RUN { &SCIPgetNRootboundChgsRun }
 number of global bound changes
 
static const Statistic< int > N_RUNS { &SCIPgetNRuns }
 number of branch and bound runs performed, including the current run
 
static const Statistic< int > N_SEPA_ROUNDS { &SCIPgetNSepaRounds }
 number of separation rounds performed so far at the current node
 
static const Statistic< SCIP_Longint > N_SOLS_FOUND { &SCIPgetNSolsFound }
 number of feasible primal solutions found so far
 
static const Statistic< SCIP_Longint > N_STRONGBRANCH_LP_ITERATIONS { &SCIPgetNStrongbranchLPIterations }
 total number of simplex iterations used so far in strong branching
 
static const Statistic< SCIP_Longint > N_STRONGBRANCHS { &SCIPgetNStrongbranchs }
 total number of times, strong branching was called (each call represents solving two LPs)
 
static const Statistic< SCIP_Longint > N_TOTAL_NODES { &SCIPgetNTotalNodes }
 total number of processed nodes in all runs, including the focus node
 
static const Statistic< SCIP_Real > PRIMAL_DUAL_INTEGRAL { &SCIPgetPrimalDualIntegral }
 recomputes and returns the primal dual gap stored in the stats
 
static const Statistic< SCIP_Real > PRIMALBOUND { &SCIPgetPrimalbound }
 global primal bound (objective value of best solution or user objective limit) for the original problem
 
static const Statistic< SCIP_Real > TRANS_GAP { &SCIPgetTransGap }
 current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds
 
static const Statistic< SCIP_Real > UPPERBOUND { &SCIPgetUpperbound }
 global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)
 

Detailed Description

Parameters to access statistics with.

since 1.2.0

Variable Documentation

◆ AVG_CONFLICT_SCORE

const Statistic<SCIP_Real> scippp::statistics::AVG_CONFLICT_SCORE { &SCIPgetAvgConflictScore }
static

average conflict score value over all variables

Definition at line 161 of file solving_statistics.hpp.

◆ AVG_CONFLICT_SCORE_CURRENT_RUN

const Statistic<SCIP_Real> scippp::statistics::AVG_CONFLICT_SCORE_CURRENT_RUN { &SCIPgetAvgConflictScoreCurrentRun }
static

average conflict score value over all variables, only using the conflict information of the current run

Definition at line 163 of file solving_statistics.hpp.

◆ AVG_CONFLICTLENGTH_SCORE

const Statistic<SCIP_Real> scippp::statistics::AVG_CONFLICTLENGTH_SCORE { &SCIPgetAvgConflictlengthScore }
static

average inference score value over all variables

Definition at line 165 of file solving_statistics.hpp.

◆ AVG_CONFLICTLENGTH_SCORE_CURRENT_RUN

const Statistic<SCIP_Real> scippp::statistics::AVG_CONFLICTLENGTH_SCORE_CURRENT_RUN { &SCIPgetAvgConflictlengthScoreCurrentRun }
static

average conflictlength score value over all variables, only using the conflictlength information of the

Definition at line 167 of file solving_statistics.hpp.

◆ AVG_CUTOFF_SCORE

const Statistic<SCIP_Real> scippp::statistics::AVG_CUTOFF_SCORE { &SCIPgetAvgCutoffScore }
static

average cutoff score value over all variables

Definition at line 173 of file solving_statistics.hpp.

◆ AVG_CUTOFF_SCORE_CURRENT_RUN

const Statistic<SCIP_Real> scippp::statistics::AVG_CUTOFF_SCORE_CURRENT_RUN { &SCIPgetAvgCutoffScoreCurrentRun }
static

average cutoff score value over all variables, only using the cutoff information of the current run

Definition at line 175 of file solving_statistics.hpp.

◆ AVG_DUALBOUND

const Statistic<SCIP_Real> scippp::statistics::AVG_DUALBOUND { &SCIPgetAvgDualbound }
static

average dual bound of all unprocessed nodes for original problem

Definition at line 123 of file solving_statistics.hpp.

◆ AVG_G_M_IEFF

const Statistic<SCIP_Real> scippp::statistics::AVG_G_M_IEFF { &SCIPgetAvgGMIeff }
static

average normalized efficacy of a GMI cut over all variables

Definition at line 177 of file solving_statistics.hpp.

◆ AVG_INFERENCE_SCORE

const Statistic<SCIP_Real> scippp::statistics::AVG_INFERENCE_SCORE { &SCIPgetAvgInferenceScore }
static

average inference score value over all variables

Definition at line 169 of file solving_statistics.hpp.

◆ AVG_INFERENCE_SCORE_CURRENT_RUN

const Statistic<SCIP_Real> scippp::statistics::AVG_INFERENCE_SCORE_CURRENT_RUN { &SCIPgetAvgInferenceScoreCurrentRun }
static

average inference score value over all variables, only using the inference information of the

Definition at line 171 of file solving_statistics.hpp.

◆ AVG_LOWERBOUND

const Statistic<SCIP_Real> scippp::statistics::AVG_LOWERBOUND { &SCIPgetAvgLowerbound }
static

average lower (dual) bound of all unprocessed nodes in transformed problem

Definition at line 125 of file solving_statistics.hpp.

◆ AVG_PSEUDOCOST_SCORE

const Statistic<SCIP_Real> scippp::statistics::AVG_PSEUDOCOST_SCORE { &SCIPgetAvgPseudocostScore }
static

average pseudo cost score value over all variables, assuming a fractionality of 0.5

Definition at line 157 of file solving_statistics.hpp.

◆ AVG_PSEUDOCOST_SCORE_CURRENT_RUN

const Statistic<SCIP_Real> scippp::statistics::AVG_PSEUDOCOST_SCORE_CURRENT_RUN { &SCIPgetAvgPseudocostScoreCurrentRun }
static

average pseudo cost score value over all variables, assuming a fractionality of 0.5,

Definition at line 159 of file solving_statistics.hpp.

◆ CUTOFFBOUND

const Statistic<SCIP_Real> scippp::statistics::CUTOFFBOUND { &SCIPgetCutoffbound }
static

global cutoff bound in transformed problem

Definition at line 145 of file solving_statistics.hpp.

◆ DETERMINISTIC_TIME

const Statistic<SCIP_Real> scippp::statistics::DETERMINISTIC_TIME { &SCIPgetDeterministicTime }
static

total number of LPs solved so far

Definition at line 179 of file solving_statistics.hpp.

◆ DUALBOUND

const Statistic<SCIP_Real> scippp::statistics::DUALBOUND { &SCIPgetDualbound }
static

global dual bound

Definition at line 127 of file solving_statistics.hpp.

◆ DUALBOUND_ROOT

const Statistic<SCIP_Real> scippp::statistics::DUALBOUND_ROOT { &SCIPgetDualboundRoot }
static

dual bound of the root node for the original problem

Definition at line 131 of file solving_statistics.hpp.

◆ FIRST_LP_DUALBOUND_ROOT

const Statistic<SCIP_Real> scippp::statistics::FIRST_LP_DUALBOUND_ROOT { &SCIPgetFirstLPDualboundRoot }
static

dual bound for the original problem of the first LP solve at the root node

Definition at line 135 of file solving_statistics.hpp.

◆ FIRST_LP_LOWERBOUND_ROOT

const Statistic<SCIP_Real> scippp::statistics::FIRST_LP_LOWERBOUND_ROOT { &SCIPgetFirstLPLowerboundRoot }
static

lower (dual) bound in transformed problem obtained by first LP solve at the root node

Definition at line 137 of file solving_statistics.hpp.

◆ FIRST_PRIMAL_BOUND

const Statistic<SCIP_Real> scippp::statistics::FIRST_PRIMAL_BOUND { &SCIPgetFirstPrimalBound }
static

primal bound of the very first solution

Definition at line 139 of file solving_statistics.hpp.

◆ GAP

const Statistic<SCIP_Real> scippp::statistics::GAP { &SCIPgetGap }
static

current gap |(primalbound - dualbound)/min(|primalbound|,|dualbound|)| if both bounds have same sign,

Definition at line 147 of file solving_statistics.hpp.

◆ LOWERBOUND

const Statistic<SCIP_Real> scippp::statistics::LOWERBOUND { &SCIPgetLowerbound }
static

global lower (dual) bound in transformed problem

Definition at line 129 of file solving_statistics.hpp.

◆ LOWERBOUND_ROOT

const Statistic<SCIP_Real> scippp::statistics::LOWERBOUND_ROOT { &SCIPgetLowerboundRoot }
static

lower (dual) bound in transformed problem of the root node

Definition at line 133 of file solving_statistics.hpp.

◆ MAX_DEPTH

const Statistic<int> scippp::statistics::MAX_DEPTH { &SCIPgetMaxDepth }
static

maximal depth of all processed nodes in current branch and bound run (excluding probing nodes)

Definition at line 113 of file solving_statistics.hpp.

◆ MAX_TOTAL_DEPTH

const Statistic<int> scippp::statistics::MAX_TOTAL_DEPTH { &SCIPgetMaxTotalDepth }
static

maximal depth of all processed nodes over all branch and bound runs

Definition at line 115 of file solving_statistics.hpp.

◆ N_ACTIVE_CONSS

const Statistic<int> scippp::statistics::N_ACTIVE_CONSS { &SCIPgetNActiveConss }
static

total number of active constraints at the current node

Definition at line 119 of file solving_statistics.hpp.

◆ N_BACKTRACKS

const Statistic<SCIP_Longint> scippp::statistics::N_BACKTRACKS { &SCIPgetNBacktracks }
static

total number of backtracks, i.e. number of times, the new node was selected from the leaves queue

Definition at line 117 of file solving_statistics.hpp.

◆ N_BARRIER_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_BARRIER_L_PS { &SCIPgetNBarrierLPs }
static

total number of barrier LPs solved so far

Definition at line 51 of file solving_statistics.hpp.

◆ N_BARRIER_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_BARRIER_LP_ITERATIONS { &SCIPgetNBarrierLPIterations }
static

total number of iterations used so far in barrier algorithm

Definition at line 53 of file solving_statistics.hpp.

◆ N_BEST_SOLS_FOUND

const Statistic<SCIP_Longint> scippp::statistics::N_BEST_SOLS_FOUND { &SCIPgetNBestSolsFound }
static

number of feasible primal solutions found so far, that improved the primal bound at the time they were found

Definition at line 155 of file solving_statistics.hpp.

◆ N_CONFLICT_CONSS_APPLIED

const Statistic<SCIP_Longint> scippp::statistics::N_CONFLICT_CONSS_APPLIED { &SCIPgetNConflictConssApplied }
static

total number of conflict constraints added to the problem

Definition at line 109 of file solving_statistics.hpp.

◆ N_CONFLICT_CONSS_FOUND

const Statistic<SCIP_Longint> scippp::statistics::N_CONFLICT_CONSS_FOUND { &SCIPgetNConflictConssFound }
static

total number of constraints found in conflict analysis (conflict and reconvergence constraints)

Definition at line 105 of file solving_statistics.hpp.

◆ N_CONFLICT_CONSS_FOUND_NODE

const Statistic<int> scippp::statistics::N_CONFLICT_CONSS_FOUND_NODE { &SCIPgetNConflictConssFoundNode }
static

number of conflict constraints found so far at the current node

Definition at line 107 of file solving_statistics.hpp.

◆ N_CONFLICT_DUALPROOFS_APPLIED

const Statistic<SCIP_Longint> scippp::statistics::N_CONFLICT_DUALPROOFS_APPLIED { &SCIPgetNConflictDualproofsApplied }
static

total number of dual proof constraints added to the problem

Definition at line 111 of file solving_statistics.hpp.

◆ N_CUTS_APPLIED

const Statistic<int> scippp::statistics::N_CUTS_APPLIED { &SCIPgetNCutsApplied }
static

total number of cuts applied to the LPs

Definition at line 103 of file solving_statistics.hpp.

◆ N_CUTS_FOUND

const Statistic<int> scippp::statistics::N_CUTS_FOUND { &SCIPgetNCutsFound }
static

total number of cuts found so far

Definition at line 99 of file solving_statistics.hpp.

◆ N_CUTS_FOUND_ROUND

const Statistic<int> scippp::statistics::N_CUTS_FOUND_ROUND { &SCIPgetNCutsFoundRound }
static

number of cuts found so far in current separation round

Definition at line 101 of file solving_statistics.hpp.

◆ N_DELAYED_CUTOFFS

const Statistic<SCIP_Longint> scippp::statistics::N_DELAYED_CUTOFFS { &SCIPgetNDelayedCutoffs }
static

number of times a selected node was from a cut off subtree

Definition at line 31 of file solving_statistics.hpp.

◆ N_DIVING_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_DIVING_L_PS { &SCIPgetNDivingLPs }
static

total number of LPs solved so far during diving and probing

Definition at line 77 of file solving_statistics.hpp.

◆ N_DIVING_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_DIVING_LP_ITERATIONS { &SCIPgetNDivingLPIterations }
static

total number of simplex iterations used so far during diving and probing

Definition at line 79 of file solving_statistics.hpp.

◆ N_DUAL_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_DUAL_L_PS { &SCIPgetNDualLPs }
static

total number of dual LPs solved so far

Definition at line 47 of file solving_statistics.hpp.

◆ N_DUAL_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_DUAL_LP_ITERATIONS { &SCIPgetNDualLPIterations }
static

total number of iterations used so far in dual simplex

Definition at line 49 of file solving_statistics.hpp.

◆ N_DUAL_RESOLVE_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_DUAL_RESOLVE_L_PS { &SCIPgetNDualResolveLPs }
static

total number of dual LPs solved so far that were resolved from an advanced start basis

Definition at line 63 of file solving_statistics.hpp.

◆ N_DUAL_RESOLVE_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_DUAL_RESOLVE_LP_ITERATIONS { &SCIPgetNDualResolveLPIterations }
static

total number of simplex iterations used so far in dual simplex calls where an advanced start

Definition at line 65 of file solving_statistics.hpp.

◆ N_ENABLED_CONSS

const Statistic<int> scippp::statistics::N_ENABLED_CONSS { &SCIPgetNEnabledConss }
static

total number of enabled constraints at the current node

Definition at line 121 of file solving_statistics.hpp.

◆ N_FEASIBLE_LEAVES

const Statistic<SCIP_Longint> scippp::statistics::N_FEASIBLE_LEAVES { &SCIPgetNFeasibleLeaves }
static

number of leaf nodes processed with feasible relaxation solution

Definition at line 21 of file solving_statistics.hpp.

◆ N_IMPLICATIONS

const Statistic<int> scippp::statistics::N_IMPLICATIONS { &SCIPgetNImplications }
static

total number of implications between variables that are stored in the implication graph

Definition at line 181 of file solving_statistics.hpp.

◆ N_INFEASIBLE_LEAVES

const Statistic<SCIP_Longint> scippp::statistics::N_INFEASIBLE_LEAVES { &SCIPgetNInfeasibleLeaves }
static

number of infeasible leaf nodes processed

Definition at line 23 of file solving_statistics.hpp.

◆ N_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_L_PS { &SCIPgetNLPs }
static

total number of LPs solved so far

Definition at line 33 of file solving_statistics.hpp.

◆ N_LIM_SOLS_FOUND

const Statistic<SCIP_Longint> scippp::statistics::N_LIM_SOLS_FOUND { &SCIPgetNLimSolsFound }
static

number of feasible primal solutions respecting the objective limit found so far

Definition at line 153 of file solving_statistics.hpp.

◆ N_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_LP_ITERATIONS { &SCIPgetNLPIterations }
static

total number of iterations used so far in primal and dual simplex and barrier algorithm

Definition at line 35 of file solving_statistics.hpp.

◆ N_N_ZS

const Statistic<SCIP_Longint> scippp::statistics::N_N_ZS { &SCIPgetNNZs }
static

number of active non-zeros in the current transformed problem

Definition at line 37 of file solving_statistics.hpp.

◆ N_NODE_INIT_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_NODE_INIT_L_PS { &SCIPgetNNodeInitLPs }
static

total number of LPs solved so far for initial LP in node relaxations

Definition at line 73 of file solving_statistics.hpp.

◆ N_NODE_INIT_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_NODE_INIT_LP_ITERATIONS { &SCIPgetNNodeInitLPIterations }
static

total number of simplex iterations used so far for initial LP in node relaxations

Definition at line 75 of file solving_statistics.hpp.

◆ N_NODE_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_NODE_L_PS { &SCIPgetNNodeLPs }
static

total number of LPs solved so far for node relaxations

Definition at line 67 of file solving_statistics.hpp.

◆ N_NODE_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_NODE_LP_ITERATIONS { &SCIPgetNNodeLPIterations }
static

total number of simplex iterations used so far for node relaxations

Definition at line 71 of file solving_statistics.hpp.

◆ N_NODE_ZERO_ITERATION_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_NODE_ZERO_ITERATION_L_PS { &SCIPgetNNodeZeroIterationLPs }
static

total number of LPs solved with 0 iteratins for node relaxations

Definition at line 69 of file solving_statistics.hpp.

◆ N_NODES

const Statistic<SCIP_Longint> scippp::statistics::N_NODES { &SCIPgetNNodes }
static

number of processed nodes in current run, including the focus node

Definition at line 17 of file solving_statistics.hpp.

◆ N_OBJLIM_LEAVES

const Statistic<SCIP_Longint> scippp::statistics::N_OBJLIM_LEAVES { &SCIPgetNObjlimLeaves }
static

number of processed leaf nodes that hit LP objective limit

Definition at line 25 of file solving_statistics.hpp.

◆ N_PRICE_ROUNDS

const Statistic<int> scippp::statistics::N_PRICE_ROUNDS { &SCIPgetNPriceRounds }
static

number of pricing rounds performed so far at the current node

Definition at line 89 of file solving_statistics.hpp.

◆ N_PRICEVARS

const Statistic<int> scippp::statistics::N_PRICEVARS { &SCIPgetNPricevars }
static

current number of variables in the pricing store

Definition at line 91 of file solving_statistics.hpp.

◆ N_PRICEVARS_APPLIED

const Statistic<int> scippp::statistics::N_PRICEVARS_APPLIED { &SCIPgetNPricevarsApplied }
static

total number of pricing variables applied to the LPs

Definition at line 95 of file solving_statistics.hpp.

◆ N_PRICEVARS_FOUND

const Statistic<int> scippp::statistics::N_PRICEVARS_FOUND { &SCIPgetNPricevarsFound }
static

total number of pricing variables found so far

Definition at line 93 of file solving_statistics.hpp.

◆ N_PRIMAL_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_PRIMAL_L_PS { &SCIPgetNPrimalLPs }
static

total number of primal LPs solved so far

Definition at line 43 of file solving_statistics.hpp.

◆ N_PRIMAL_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_PRIMAL_LP_ITERATIONS { &SCIPgetNPrimalLPIterations }
static

total number of iterations used so far in primal simplex

Definition at line 45 of file solving_statistics.hpp.

◆ N_PRIMAL_RESOLVE_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_PRIMAL_RESOLVE_L_PS { &SCIPgetNPrimalResolveLPs }
static

total number of primal LPs solved so far that were resolved from an advanced start basis

Definition at line 59 of file solving_statistics.hpp.

◆ N_PRIMAL_RESOLVE_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_PRIMAL_RESOLVE_LP_ITERATIONS { &SCIPgetNPrimalResolveLPIterations }
static

total number of simplex iterations used so far in primal simplex calls where an advanced start

Definition at line 61 of file solving_statistics.hpp.

◆ N_REOPT_RUNS

const Statistic<int> scippp::statistics::N_REOPT_RUNS { &SCIPgetNReoptRuns }
static

number of reoptimization runs performed, including the current run

Definition at line 15 of file solving_statistics.hpp.

◆ N_RESOLVE_L_PS

const Statistic<SCIP_Longint> scippp::statistics::N_RESOLVE_L_PS { &SCIPgetNResolveLPs }
static

total number of LPs solved so far that were resolved from an advanced start basis

Definition at line 55 of file solving_statistics.hpp.

◆ N_RESOLVE_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_RESOLVE_LP_ITERATIONS { &SCIPgetNResolveLPIterations }
static

total number of simplex iterations used so far in primal and dual simplex calls where an advanced start

Definition at line 57 of file solving_statistics.hpp.

◆ N_ROOT_FIRST_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_ROOT_FIRST_LP_ITERATIONS { &SCIPgetNRootFirstLPIterations }
static

total number of iterations used in primal and dual simplex and barrier algorithm for the first root LP

Definition at line 41 of file solving_statistics.hpp.

◆ N_ROOT_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_ROOT_LP_ITERATIONS { &SCIPgetNRootLPIterations }
static

total number of iterations used so far in primal and dual simplex and barrier algorithm for the root node

Definition at line 39 of file solving_statistics.hpp.

◆ N_ROOT_STRONGBRANCH_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_ROOT_STRONGBRANCH_LP_ITERATIONS { &SCIPgetNRootStrongbranchLPIterations }
static

total number of simplex iterations used so far in strong branching at the root node

Definition at line 87 of file solving_statistics.hpp.

◆ N_ROOT_STRONGBRANCHS

const Statistic<SCIP_Longint> scippp::statistics::N_ROOT_STRONGBRANCHS { &SCIPgetNRootStrongbranchs }
static

total number of times, strong branching was called at the root node (each call represents solving two LPs)

Definition at line 85 of file solving_statistics.hpp.

◆ N_ROOTBOUND_CHGS

const Statistic<int> scippp::statistics::N_ROOTBOUND_CHGS { &SCIPgetNRootboundChgs }
static

number of global bound changes

Definition at line 27 of file solving_statistics.hpp.

◆ N_ROOTBOUND_CHGS_RUN

const Statistic<int> scippp::statistics::N_ROOTBOUND_CHGS_RUN { &SCIPgetNRootboundChgsRun }
static

number of global bound changes

Definition at line 29 of file solving_statistics.hpp.

◆ N_RUNS

const Statistic<int> scippp::statistics::N_RUNS { &SCIPgetNRuns }
static

number of branch and bound runs performed, including the current run

Definition at line 13 of file solving_statistics.hpp.

◆ N_SEPA_ROUNDS

const Statistic<int> scippp::statistics::N_SEPA_ROUNDS { &SCIPgetNSepaRounds }
static

number of separation rounds performed so far at the current node

Definition at line 97 of file solving_statistics.hpp.

◆ N_SOLS_FOUND

const Statistic<SCIP_Longint> scippp::statistics::N_SOLS_FOUND { &SCIPgetNSolsFound }
static

number of feasible primal solutions found so far

Definition at line 151 of file solving_statistics.hpp.

◆ N_STRONGBRANCH_LP_ITERATIONS

const Statistic<SCIP_Longint> scippp::statistics::N_STRONGBRANCH_LP_ITERATIONS { &SCIPgetNStrongbranchLPIterations }
static

total number of simplex iterations used so far in strong branching

Definition at line 83 of file solving_statistics.hpp.

◆ N_STRONGBRANCHS

const Statistic<SCIP_Longint> scippp::statistics::N_STRONGBRANCHS { &SCIPgetNStrongbranchs }
static

total number of times, strong branching was called (each call represents solving two LPs)

Definition at line 81 of file solving_statistics.hpp.

◆ N_TOTAL_NODES

const Statistic<SCIP_Longint> scippp::statistics::N_TOTAL_NODES { &SCIPgetNTotalNodes }
static

total number of processed nodes in all runs, including the focus node

Definition at line 19 of file solving_statistics.hpp.

◆ PRIMAL_DUAL_INTEGRAL

const Statistic<SCIP_Real> scippp::statistics::PRIMAL_DUAL_INTEGRAL { &SCIPgetPrimalDualIntegral }
static

recomputes and returns the primal dual gap stored in the stats

Definition at line 183 of file solving_statistics.hpp.

◆ PRIMALBOUND

const Statistic<SCIP_Real> scippp::statistics::PRIMALBOUND { &SCIPgetPrimalbound }
static

global primal bound (objective value of best solution or user objective limit) for the original problem

Definition at line 141 of file solving_statistics.hpp.

◆ TRANS_GAP

const Statistic<SCIP_Real> scippp::statistics::TRANS_GAP { &SCIPgetTransGap }
static

current gap |(upperbound - lowerbound)/min(|upperbound|,|lowerbound|)| in transformed problem if both bounds

Definition at line 149 of file solving_statistics.hpp.

◆ UPPERBOUND

const Statistic<SCIP_Real> scippp::statistics::UPPERBOUND { &SCIPgetUpperbound }
static

global upper (primal) bound in transformed problem (objective value of best solution or user objective limit)

Definition at line 143 of file solving_statistics.hpp.