Package topics.branchandbound.util

package topics.branchandbound.util

Utility classes shared by branch-and-bound implementations.

Provides the priority-queue-based infrastructure (heap and node structures) and the core best-first search logic used by the branch-and-bound algorithms in topics.branchandbound.

Classes in This Package

• BranchAndBound — best-first B&B driver
• Heap — min/max heap implementation
• Node — search-tree node with cost and bound

Related Packages

Package	Description
topics.branchandbound	Branch-and-Bound algorithms — intelligent search for combinatorial optimisation.
topics.branchandbound.util.threads	Multi-threaded branch-and-bound utilities.
topics.branchandbound.times	Execution-time benchmarks for branch-and-bound algorithms.

Classes

Class	Description
BranchAndBound	Main class to solve problems using the Branch and Bound technique We need to extend it for any specific problem
Heap	To save and sort the nodes that are going to be used
Node	To represent the different states of a problem in the graph For each problem, we should extend this class with specific information We also need to compare Nodes because it is the way to compare them in the priority queue