struct_tree.h
Go to the documentation of this file.
22 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
87 /** fork without LP solution, where bounds and constraints have been changed, and rows and columns were added */
97 /** fork with solved LP, where bounds and constraints have been changed, and rows and columns were added */
103 SCIP_Real lpobjval; /**< the LP objective value for that node, needed to compute the pseudo costs correctly */
109 unsigned int lpwasprimchecked:1; /**< primal feasibility check state of saved LP state information */
111 unsigned int lpwasdualchecked:1; /**< dual feasibility check state of saved LP state information */
114 /** fork with solved LP, where bounds and constraints have been changed, and rows and columns were removed and added */
120 SCIP_Real lpobjval; /**< the LP objective value for that node, needed to compute the pseudo costs correctly */
126 unsigned int lpwasprimchecked:1; /**< primal feasibility check state of saved LP state information */
128 unsigned int lpwasdualchecked:1; /**< dual feasibility check state of saved LP state information */
155 unsigned int reprop:1; /**< should propagation be applied again, if the node is on the active path? */
205 SCIP_Real* probdiverelaxsol; /**< array with stored original relaxation solution during diving or probing */
207 SCIP_Longint focuslpstateforklpcount; /**< LP number of last solved LP in current LP state fork, or -1 if unknown */
214 int nchildren; /**< number of children of focus node (number of used slots in children vector) */
216 int nsiblings; /**< number of siblings of focus node (number of used slots in siblings vector) */
220 int appliedeffectiverootdepth; /**< the effective root depth which was already enforced (that is constraint and bound changes were made global) */
221 int correctlpdepth; /**< depth to which current LP data corresponds to LP data of active path */
224 int repropsubtreecount; /**< cyclicly increased counter to create markers for subtree repropagation */
227 SCIP_Bool probingnodehaslp; /**< was the LP solved (at least once) in the current probing node? */
229 SCIP_Bool cutoffdelayed; /**< the treeCutoff() call was delayed because of diving and has to be executed */
232 SCIP_Bool probingloadlpistate;/**< must the LP state be reloaded because of a backtrack in probing? */
233 SCIP_Bool probinglpwasrelax; /**< was the LP a valid relaxation before we entered the probing mode? */
234 SCIP_Bool probingsolvedlp; /**< was the LP solved during probing mode, i.e., was SCIPsolveProbingLP() called? */
239 SCIP_Bool probinglpwasprimchecked;/**< primal feasibility has been checked when probing started */
243 SCIP_Bool probdiverelaxincludeslp; /**< did the stored relaxation solution include all lp cuts ? */
Definition: struct_var.h:151
Definition: struct_var.h:198
Definition: struct_tree.h:46
Definition: struct_tree.h:115
Definition: struct_tree.h:132
Definition: struct_lp.h:126
Definition: lpi_cpx.c:188
type definitions for LP management
Definition: struct_cons.h:37
Definition: struct_tree.h:64
Definition: struct_tree.h:76
type definitions for specific LP solvers interface
type definitions for problem variables
Definition: struct_tree.h:70
Definition: struct_prop.h:37
Definition: struct_tree.h:162
Definition: struct_lp.h:192
Definition: struct_tree.h:82
type definitions for branch and bound tree
type definitions for propagators
Definition: struct_tree.h:88
Definition: lpi_clp.cpp:123
Definition: struct_tree.h:98
Definition: struct_nodesel.h:40
Definition: struct_cons.h:106
type definitions for branching and inference history
Definition: struct_tree.h:175
common defines and data types used in all packages of SCIP
type definitions for node selectors
type definitions for constraints and constraint handlers