Sumários
Minimum cost flow problem. Introduction to Dynamic Programming.
11 março 2019, 09:30 • João Miguel da Costa Sousa
Minimum cost flow problem. Introduction to Dynamic Programming.
Simplex method and Sensitivity Analysis
7 março 2019, 14:00 • Susana Vieira
Simplex method and Sensitivity Analysis
Shortest path problem. Minimum spanning tree problem. Maximum flow problems.
7 março 2019, 09:30 • João Miguel da Costa Sousa
Shortest path problem. Minimum spanning tree problem. Maximum flow problems.
Transportation and assignment problems. Network models.
28 fevereiro 2019, 09:30 • João Miguel da Costa Sousa
Transportation and assignment problems. Network models.