Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <gscip_constraint_handler.h>
Public Attributes | |
int64_t | current_node_id = 0 |
int64_t | num_processed_nodes = 0 |
int64_t | num_nodes_left = 0 |
The number of open nodes left in the current run. See SCIPgetNNodesLeft(). | |
int64_t | num_processed_nodes_total = 0 |
double | primal_bound = 0.0 |
The global primal bound on the problem. See SCIPgetPrimalBound(). | |
double | dual_bound = 0.0 |
The global dual bound on the problem. See SCIPgetDualBound(). | |
int64_t | primal_simplex_iterations = 0 |
int64_t | dual_simplex_iterations = 0 |
int32_t | num_solutions_found = 0 |
int32_t | num_cuts_in_lp = 0 |
Definition at line 131 of file gscip_constraint_handler.h.
int64_t operations_research::GScipCallbackStats::current_node_id = 0 |
A unique id within a run, assigned consecutively by order of creation. -1 if no nodes have been created yet, or num_processed_nodes if search is over. See SCIPgetCurrentNode().
Definition at line 135 of file gscip_constraint_handler.h.
double operations_research::GScipCallbackStats::dual_bound = 0.0 |
The global dual bound on the problem. See SCIPgetDualBound().
Definition at line 153 of file gscip_constraint_handler.h.
int64_t operations_research::GScipCallbackStats::dual_simplex_iterations = 0 |
The number of pivots taken by the dual simplex method. See SCIPgetNDualLPIterations().
Definition at line 161 of file gscip_constraint_handler.h.
int32_t operations_research::GScipCallbackStats::num_cuts_in_lp = 0 |
The number of rows in the current LP that were added as cuts. See SCIPgetNPoolCuts().
Definition at line 169 of file gscip_constraint_handler.h.
int64_t operations_research::GScipCallbackStats::num_nodes_left = 0 |
The number of open nodes left in the current run. See SCIPgetNNodesLeft().
Definition at line 142 of file gscip_constraint_handler.h.
int64_t operations_research::GScipCallbackStats::num_processed_nodes = 0 |
The number of processed nodes in the current run (i.e. does not include nodes before a restart), including the focus node. See SCIPgetNNodes().
Definition at line 139 of file gscip_constraint_handler.h.
int64_t operations_research::GScipCallbackStats::num_processed_nodes_total = 0 |
The total number of processed nodes in all runs, including the focus node. If the solver restarts > 1 time, will be larger than num_processed_nodes, otherwise is equal. See SCIPgetNTotalNodes().
Definition at line 147 of file gscip_constraint_handler.h.
int32_t operations_research::GScipCallbackStats::num_solutions_found = 0 |
The number of feasible solutions found that were at least as good as the cutoff limit. See SCIPgetNLimSolsFound().
Definition at line 165 of file gscip_constraint_handler.h.
double operations_research::GScipCallbackStats::primal_bound = 0.0 |
The global primal bound on the problem. See SCIPgetPrimalBound().
Definition at line 150 of file gscip_constraint_handler.h.
int64_t operations_research::GScipCallbackStats::primal_simplex_iterations = 0 |
The number of pivots taken by the primal simplex method. See SCIPgetNPrimalLPIterations().
Definition at line 157 of file gscip_constraint_handler.h.