Sumários

Network Flows

29 outubro 2019, 16:30 • José Rui De Matos Figueira

Exercises with the primal network flow algorithm for the minimum cost network flow problem.

Network Flows

29 outubro 2019, 13:30 • José Rui De Matos Figueira

Hungarian algorithm for the assignment problem. Dantzig algorithm for the transporation problem. Negative cycle/circuit algorithm for the minimum cost network flow problem. Kruskal algorithm for the minimum spanning tree problem.

Network Flows

28 outubro 2019, 18:00 • José Rui De Matos Figueira

Exercises with the primal network flow algorithm for the minimum cost network flow problem.

Network Flows

28 outubro 2019, 16:30 • José Rui De Matos Figueira

Exercises with the primal network flow algorithm for the minimum cost network flow problem.

Network Flows

28 outubro 2019, 15:00 • José Rui De Matos Figueira

Shortest path problems (Dijksta and Bellman-Ford algorithms). Max flow problem (Ford-Fulkerson algorithm)