struct_tree.h
Go to the documentation of this file.
31/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
96/** fork without LP solution, where bounds and constraints have been changed, and rows and columns were added */
106/** fork with solved LP, where bounds and constraints have been changed, and rows and columns were added */
112 SCIP_Real lpobjval; /**< the LP objective value for that node, needed to compute the pseudo costs correctly */
118 unsigned int lpwasprimchecked:1; /**< primal feasibility check state of saved LP state information */
120 unsigned int lpwasdualchecked:1; /**< dual feasibility check state of saved LP state information */
123/** fork with solved LP, where bounds and constraints have been changed, and rows and columns were removed and added */
129 SCIP_Real lpobjval; /**< the LP objective value for that node, needed to compute the pseudo costs correctly */
135 unsigned int lpwasprimchecked:1; /**< primal feasibility check state of saved LP state information */
137 unsigned int lpwasdualchecked:1; /**< dual feasibility check state of saved LP state information */
166 unsigned int reprop:1; /**< should propagation be applied again, if the node is on the active path? */
214 SCIP_Real* probdiverelaxsol; /**< array with stored original relaxation solution during diving or probing */
216 SCIP_Longint focuslpstateforklpcount; /**< LP number of last solved LP in current LP state fork, or -1 if unknown */
223 int nchildren; /**< number of children of focus node (number of used slots in children vector) */
225 int nsiblings; /**< number of siblings of focus node (number of used slots in siblings vector) */
229 int appliedeffectiverootdepth; /**< the effective root depth which was already enforced (that is constraint and bound changes were made global) */
230 int correctlpdepth; /**< depth to which current LP data corresponds to LP data of active path */
233 int repropsubtreecount; /**< cyclicly increased counter to create markers for subtree repropagation */
236 SCIP_Bool probingnodehaslp; /**< was the LP solved (at least once) in the current probing node? */
238 SCIP_Bool cutoffdelayed; /**< the treeCutoff() call was delayed because of diving and has to be executed */
241 SCIP_Bool probingloadlpistate;/**< must the LP state be reloaded because of a backtrack in probing? */
242 SCIP_Bool probinglpwasrelax; /**< was the LP a valid relaxation before we entered the probing mode? */
243 SCIP_Bool probingsolvedlp; /**< was the LP solved during probing mode, i.e., was SCIPsolveProbingLP() called? */
248 SCIP_Bool probinglpwasprimchecked;/**< primal feasibility has been checked when probing started */
252 SCIP_Bool probdiverelaxincludeslp; /**< did the stored relaxation solution include all lp cuts ? */
common defines and data types used in all packages of SCIP
Definition: struct_tree.h:80
Definition: struct_lp.h:136
Definition: struct_cons.h:116
Definition: struct_cons.h:47
Definition: struct_tree.h:108
Definition: struct_tree.h:92
Definition: lpi_cpx.c:199
Definition: lpi_clp.cpp:133
Definition: struct_tree.h:86
Definition: struct_nodesel.h:50
Definition: struct_tree.h:142
union SCIP_Node::@19 data
Definition: struct_tree.h:172
Definition: struct_tree.h:56
Definition: struct_prop.h:47
Definition: struct_tree.h:98
Definition: struct_lp.h:202
Definition: struct_tree.h:74
Definition: struct_tree.h:125
Definition: struct_tree.h:185
Definition: struct_var.h:208
type definitions for constraints and constraint handlers
type definitions for branching and inference history
type definitions for LP management
type definitions for specific LP solvers interface
type definitions for node selectors
type definitions for propagators
type definitions for branch and bound tree
type definitions for problem variables
Definition: struct_var.h:161