**Additional Resources:**

## Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search

This is a java program to solve TSP using branch and bound algorithm. Branch and bound (BB or B&B) is an algorithm design paradigm for discrete and combinatorial optimization problems. A branch-and-bound algorithm consists of a systematic enumeration of candidate solutions by means of state space search: the set of candidate solutions is thought of … Read more