Sign inSign in
ConceptEngineering

Branch and bound

An algorithm design paradigm for discrete and combinatorial optimization problems that systematically enumerates candidate solutions.
as Rachel Bunder defines itPyCon AUThe wording closest to all 5 definitions
Watch it explained

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

5

Each in their own terms, from the easiest level.

  • Jon Bentley

    MIT · Undergraduate

    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.
    • 49:22Tuning a TSP Algorithm
  • Patrick Winston

    MIT · Undergraduate

    An algorithm for finding the shortest path by systematically exploring paths and bounding them against known path lengths to the goal.
    • 11:13Search: Optimal, Branch and Bound, A*
  • Russ Tedrake

    MIT · Undergraduate

    An algorithm for solving mixed-integer programs by systematically branching on non-integer variables and bounding solutions using convex relaxations.
    • 16:49Mixed-discrete (combinatorial) and continuous optimization
  • Stephen Boyd

    Stanford University · Graduate

    A family of global optimization methods for nonconvex problems that maintain provable lower and upper bounds on the global objective value.
    • 1:03:37Convex Optimization II: Stochastic Model Predictive Control and Branch-and-Bound Methods

Lectures that assume it

2

Connections

17

The lectures that define it or assume it, and the concepts next to it.

5 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.