Premium Content

Branch and Bound

Intelligent pruning for optimization problems

This chapter requires a subscription to access.

What you'll unlock:

  • 1. Beyond Backtracking: Bounds
  • 2. The B&B Framework
  • 3. Traveling Salesman Problem
  • 4. Assignment Problem
  • 5. 0/1 Knapsack with B&B
  • 6. Best-First vs DFS Strategy
Subscribe to Unlock

Already have an account? Sign in