<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/downloads/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/full-index/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/self-assessment/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/graphs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/maximum-flow/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/min-cost-flow/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/minimum-spanning-trees/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/network-flow-models/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/network-simplex/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/project-management/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/shortest-paths/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/exercises/transportation-and-assignment/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/applications/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/cuts/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/the-edmonds-karp-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/the-ford-fulkerson-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/the-max-flow-min-cut-theorem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/the-maximum-flow-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/maximum-flow/the-residual-network/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/a-first-feasible-flow/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/circulations-and-their-decomposition/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/negative-cycle-optimality-conditions/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/optimality-conditions-with-potentials/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/the-cycle-canceling-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/the-residual-network-with-costs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/min-cost-flow/the-successive-shortest-path-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/a-transshipment-instance/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/feasibility-conditions/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/networks-and-flows/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/removing-the-lower-bounds/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/special-cases/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/the-dual-model-and-the-reduced-costs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/the-minimum-cost-flow-model/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/total-unimodularity-and-integrality/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/network-flow-models/unbalanced-instances/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/transportation-and-assignment/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/transportation-and-assignment/basic-solutions/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/transportation-and-assignment/initial-basic-feasible-solutions/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/transportation-and-assignment/the-assignment-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/transportation-and-assignment/the-potential-method/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/flows/transportation-and-assignment/the-transportation-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/graphs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/graphs/connectivity/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/graphs/graph-search/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/graphs/representations-of-a-graph/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/graphs/the-rank-of-the-incidence-matrix/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/graphs/trees-and-forests/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/graphs/graphs/undirected-and-directed-graphs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/assignment-hungarian-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/critical-path-method/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/graph-search-bfs-dfs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/maximum-flow-ford-fulkerson-edmonds-karp/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/minimum-cost-flow/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/minimum-spanning-tree-kruskal-prim/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/network-simplex/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/shortest-paths-dijkstra-bellman-ford/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/lab/transportation-potentials-method/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/a-capacitated-example-with-a-degenerate-pivot/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/an-uncapacitated-example/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/bases-and-spanning-trees/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/degeneracy-and-strongly-feasible-trees/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/potentials-and-optimality/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/the-initial-tree-phase-0/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/the-network-simplex-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/the-pivot/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/network-simplex/network-simplex/the-simplex-algorithm-on-the-minimum-cost-flow-model/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/paths-and-critical-paths/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/projects-and-project-networks/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/slacks-and-critical-activities/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/the-backward-pass-latest-times/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/the-critical-path-method/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/the-forward-pass-earliest-times/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/the-linear-programming-model/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/project-management/project-management/two-critical-paths-and-changes-of-durations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/cuts-and-cycles/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/kruskal-s-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/prim-s-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/the-cut-property-and-the-cycle-property/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/the-generic-greedy-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/the-minimum-spanning-tree-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/minimum-spanning-trees/uniqueness-of-the-minimum-spanning-tree/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/shortest-paths/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/shortest-paths/dijkstra-s-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/shortest-paths/optimality-conditions-and-potentials/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/shortest-paths/shortest-path-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/shortest-paths/shortest-paths-in-acyclic-graphs/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/shortest-paths/the-bellman-ford-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/network-optimization/trees-and-paths/shortest-paths/the-linear-programming-formulation/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
</urlset>