com.numericalmethod.suanshu.algorithm.bb

Interface BBNode

All Superinterfaces:

ConstrainedOptimProblem, OptimProblem, java.io.Serializable

All Known Implementing Classes:

ILPNode

public interface BBNode
extends ConstrainedOptimProblem

A branch-and-bound algorithm maintains a tree of nodes to keep track of the search paths and the pruned paths. The BranchAndBound code works in conjunction with a node class that implements this interface.

Method Summary

Modifier and Type	Method and Description
java.util.List<? extends BBNode>	branching() Get the children of this node by using the branching operation.
boolean	isCandidate() Check if this node is a possible solution to the original problem, e.g., not pruned.
ImmutableVector	solution() the solution to the sub-problem associated with this node
double	value() the value of this node

Methods inherited from interface com.numericalmethod.suanshu.optimization.constrained.problem.ConstrainedOptimProblem

getEqualityConstraints, getLessThanConstraints

Methods inherited from interface com.numericalmethod.suanshu.optimization.problem.OptimProblem

dimension, f

Method Detail

solution

ImmutableVector solution()

the solution to the sub-problem associated with this node

Returns:

the solution to the sub-problem associated with this node

value

double value()

the value of this node

Returns:

the value of this node

isCandidate

boolean isCandidate()

Check if this node is a possible solution to the original problem, e.g., not pruned.

Returns:

true if this node is a possible solution to the original problem

branching

java.util.List<? extends BBNode> branching()

Get the children of this node by using the branching operation.

Returns:

the children of this node