ConceptEngineering
Branch and bound
An algorithm design paradigm for discrete and combinatorial optimization problems that systematically enumerates candidate solutions.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Jon Bentley
A search strategy for optimization problems that prunes branches of the search space that cannot yield a better solution than the best one found so far.Patrick Winston
An algorithm for finding the shortest path by systematically exploring paths and bounding them against known path lengths to the goal.Russ Tedrake
An algorithm for solving mixed-integer programs by systematically branching on non-integer variables and bounding solutions using convex relaxations.Stephen Boyd
A family of global optimization methods for nonconvex problems that maintain provable lower and upper bounds on the global objective value.
Lectures that assume it
2Connections
17The lectures that define it or assume it, and the concepts next to it.
Concepts10
Lectures7
- Tuning a TSP Algorithm
- Search: Optimal, Branch and Bound, A*
- Convex Optimization II: Stochastic Model Predictive Control and Branch-and-Bound Methods
- Mixed-discrete (combinatorial) and continuous optimization
- Gerrymandering Australia: Electoral District Simulation with Python
- Search: Games, Minimax, and Alpha-Beta Pruning