This interface defines the node popping strategy used in a branch-and-bound algorithm, e.g., depth-first-search, best-first-search.
A branch-and-bound algorithm maintains a tree of nodes to keep track of the search paths and the pruned paths.
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.
Copyright © 2010-2017 Numerical Method Incorporation Limited. All Rights Reserved.