Branch and Bound (NC2.2)
Channel: Complexity Papers
Date: 2024-04-06

This is part 2 of lecture 2 in the Networks and Complexity course. In this video I discuss the "Branch and Bound" problem solving strategy that is used in Dijkstra's algorithm and summarize the problem solving strategies that we have encountered so far. 

Part 1 is here: https://youtu.be/LDKjs_t7oUk

FURTHER MATERIAL
- This course will be published as a book with Springer (It's not out yet)
- Additional exercises and solutions (will be available eventually)

OTHER LECTURES IN THIS COURSE 
01 - https://youtu.be/AriHQz6x3uY - Brute force, number of networks, Minimum spanning tree, greedy algorithms 
02 - https://youtu.be/LDKjs_t7oUk - Shortest path, branch and bound, Dijkstra's algorithm 
 
CONTENTS
00:00 Introduction 
00:31 Remarks on numerical implemtation
02:03 Branch & Bound
08:17 Problem Solving Toolkit
10:54 Conclusions