Branch and Bound - Algorithms Part 13
In this lecture, we discuss branch and bound algorithms, a method for practically solving NP-hard problems for which no poly-time algorithm is known. In particular, we discuss how to use this formulation to solve both the 0/1 knapsack problem and the traveling salesman problem (TSP).
Timestamps:
00:00 Introduction
00:19 Construction and General Formulation
02:17 0/1 Knapsack Problem
05:31 Traveling Salesman Problem (TSP)
08:15 Conclusion
#branchandbound #graphtheory #optimization #tsp #knapsack #np #algorithms #timecomplexity #computerscience #education