Core Package
Here you’ll find the main contents of the bnbpy package.
For the core components of the branch-and-bound framework, please refer to the following sections:
Problem for the definition of the optimization problem.
Search for the branch-and-bound search algorithm.
Solution for the representation of solutions.
OptStatus for optimization status.
Node Managers for node manager interface and simple LIFO/FIFO managers.
Priority Managers for priority manager node managers.
Node Priority Queue for C++-backed priority queue managers.
Level Queue for level-based node managers (cyclic best-first and DFS).
Node for the representation of nodes.
For a detailed documentation of its column generation submodule, please refer to Column Generation.