Sign inSign in
ConceptEngineering

Dual decomposition network flow algorithm

An algorithm that iteratively determines link flows from potential differences, computes node flow surpluses, and updates node potentials to solve network flow problems.
as Stephen Boyd defines itStanford 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.

Lecturers

1

    Connections

    4

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

    Concepts3

    1 lecturer. 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.