#include <branchMIP.h>
Inheritance diagram for branchMIP:
Public Member Functions | |
branchMIP (mipInstance &) throw () | |
branchMIP (branchMIP &) throw () | |
~branchMIP () throw () | |
unsigned long | Size () const throw () |
unsigned long | Allocated () const throw () |
TVar | SelectVariable () throw () |
TBranchDir | DirectionConstructive (TVar i) throw (ERRange) |
TBranchDir | DirectionExhaustive (TVar i) throw (ERRange) |
branchNode< TVar, TFloat > * | Clone () throw () |
void | Raise (TVar i) throw (ERRange) |
void | Lower (TVar i) throw (ERRange) |
TFloat | SolveRelaxation () throw () |
TObjectSense | ObjectSense () const throw () |
TFloat | Infeasibility () const throw () |
bool | Feasible () throw () |
void | SaveSolution () throw () |
Data Fields | |
mipInstance & | X |
mipInstance * | Y |
|
|
|
|
|
|
|
Reimplemented from branchNode< TVar, TFloat >. |
|
Generate a copy of this branch node.
Implements branchNode< TVar, TFloat >. |
|
Preferred search direction before feasibility has been achieved.
Implements branchNode< TVar, TFloat >. |
|
Preferred search direction after feasibility has been achieved.
Implements branchNode< TVar, TFloat >. |
|
Reimplemented from branchNode< TVar, TFloat >. |
|
Symbolic value for infeasible subproblems.
Implements branchNode< TVar, TFloat >. |
|
Lower an upper variable bound. This operation applies after solving a relaxation and duplicating the branch node. It sets an upper variable bound to the greatest integral lower bound on the current variable value. The operation may restrict further variables, namely, if it is obvoious that no solutions for the master problem are lost.
Implements branchNode< TVar, TFloat >. |
|
Decide between maximization and minimization problems.
Implements branchNode< TVar, TFloat >. |
|
Raise a lower variable bound. This operation applies after solving a relaxation and duplicating the branch node. It sets a lower variable bound to the least integral upper bound on the current variable value. The operation may restrict further variables, namely, if it is obvoious that no solutions for the master problem are lost.
Implements branchNode< TVar, TFloat >. |
|
Copy the current solution to the original problem instance.
Implements branchNode< TVar, TFloat >. |
|
Selection of a variable to be restricted next.
Implements branchNode< TVar, TFloat >. |
|
Implements goblinRootObject. |
|
Solve the relaxed subproblem according.
Implements branchNode< TVar, TFloat >. |
|
|
|
|