Skip to content
Nydus Open Learning

Linear programming

Shortest paths

One number per node instead of a list of routes: settle the nearest, relax its arcs, repeat.

About 20 minutes7 activities Paper packet