Package | Description |
---|---|
dev.nm.misc.algorithm.bb | |
dev.nm.solver.multivariate.constrained.integer.linear.bb |
Modifier and Type | Method and Description |
---|---|
BBNode |
ActiveList.pop()
Get the next node.
|
BBNode |
BranchAndBound.search(BBNode... initials) |
Modifier and Type | Method and Description |
---|---|
List<? extends BBNode> |
BBNode.branching()
Get the children of this node by using the branching operation.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ActiveList.add(BBNode node)
Add a node to the active list.
|
BBNode |
BranchAndBound.search(BBNode... initials) |
void |
BranchAndBound.setInitials(BBNode... root) |
Constructor and Description |
---|
BranchAndBound(ActiveList activeList,
BBNode root)
Solve a minimization problem using a branch-and-bound algorithm.
|
BranchAndBound(BBNode root)
Solve a minimization problem using a branch-and-bound algorithm using depth-first search.
|
Modifier and Type | Class and Description |
---|---|
class |
ILPNode
This is the branch-and-bound node used in conjunction with
ILPBranchAndBoundMinimizer to
solve an Integer Linear Programming problem. |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.