| Interface | Description |
|---|---|
| ActiveList |
This interface defines the node popping strategy used in a branch-and-bound algorithm, e.g., depth-first-search, best-first-search.
|
| BBNode |
A branch-and-bound algorithm maintains a tree of nodes to keep track of the search paths and the pruned paths.
|
| Class | Description |
|---|---|
| BranchAndBound |
Branch-and-Bound (BB or B&B) is a general algorithm for finding optimal solutions of various optimization problems,
especially in discrete and combinatorial optimization.
|