Sign inSign in
ConceptSystems & CS

Branch-and-bound pruning

Pruning branches in the search tree based on properties and cumulative costs once the bottom of the tree is reached.
as Andy Pavlo defines itCarnegie Mellon University
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

2

Each in their own terms, from the easiest level.

  • Jon Bentley

    MIT · Undergraduate

    Stopping search paths early when the current accumulated cost plus any possible completion exceeds the current minimum solution found.
    • 50:20Tuning a TSP Algorithm

Lectures that assume it

1

Connections

8

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

2 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.