ILOG CPLEX C++ API 9.0 Reference Manual
ILOG CPLEX C++ API 9.0 Reference Manual
ILOG CPLEX C++ API 9.0 Reference Manual
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
IloCplex::NodeCallbackI<br />
NodeId for each of the remaining nodes (0 to n-1). Such a query allows you to<br />
associate data with individual nodes.<br />
The methods of this class are protected for use in deriving a user-written callback class<br />
and in implementing the main method there.<br />
If an attempt is made to access information not available to an instance of this class, an<br />
exception is thrown.<br />
See Also<br />
Constructors<br />
Methods<br />
IloCplex, IloCplex::Callback, IloCplex::CallbackI,<br />
IloCplex::MIPCallbackI, ILONODECALLBACK0<br />
protected NodeCallbackI()<br />
This constructor creates a callback for use in an application with user-defined node<br />
selection inquiry during branch & cut searches.<br />
protected IloNumVar getBranchVar(NodeId nodeid)<br />
This method returns the variable that was branched on last when <strong>CPLEX</strong> created the<br />
node with the identifier nodeid. If that node has been created by branching on a<br />
constraint or on multiple variables, 0 (zero) will be returned.<br />
protected IloNumVar getBranchVar(int node)<br />
Returns the variable that was branched on last when creating the node indicated by the<br />
index number node. If that node has been created by branching on a constraint or on<br />
multiple variables, 0 (zero) will be returned.<br />
protected IloInt getDepth(NodeId nodeid)<br />
This method returns the depth of the node in the search tree for the node with the<br />
identifier nodeid. The root node has depth 0 (zero). The depth of other nodes is<br />
defined recursively as the depth of their parent node plus one. In other words, the depth<br />
of a node is its distance in terms of the number of branches from the root.<br />
protected IloInt getDepth(int node)<br />
This method returns the depth of the node in the search tree. The root node has depth 0<br />
(zero). The depth of other nodes is defined recursively as the depth of their parent node<br />
plus one. In other words, the depth of a node is its distance in terms of the number of<br />
branches from the root.<br />
protected IloNum getEstimatedObjValue(NodeId nodeid)<br />
This method returns the estimated objective value of the node with the identifier node.<br />
protected IloNum getEstimatedObjValue(int node)<br />
This method returns the estimated objective value of the node indicated by the index<br />
number node.<br />
<strong>ILOG</strong> <strong>CPLEX</strong> <strong>C++</strong> <strong>API</strong> <strong>9.0</strong> REFERENCE M ANUAL 189