<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/downloads/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/full-index/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/knapsack-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/lot-sizing-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/miscellaneous-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/principles/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/self-assessment/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-bounded-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-capacitated-lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-coin-change/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-knapsack/a-first-dp-algorithm-an-implementation-with-lists/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-knapsack/a-first-dp-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-knapsack/a-second-dp-algorithm-an-implementation-with-lists/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-knapsack/a-second-dp-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-knapsack/typical-mistakes/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-knapsack-setups/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-lot-sizing/a-dp-algorithm-for-the-uls-step-1-and-step-2/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-lot-sizing/a-dp-algorithm-for-the-uls/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-lot-sizing/typical-mistakes/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-multidimensional-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-multiple-choice-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-multiple-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-principles/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-rod-cutting/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-rod-cutting/a-first-dp-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-rod-cutting/a-second-dp-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-rod-cutting/typical-mistakes/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-subset-sum/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-unbounded-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-unbounded-knapsack/a-first-dp-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-unbounded-knapsack/a-second-dp-algorithm/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/dp-unbounded-knapsack/typical-mistakes/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-bounded-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-capacitated-lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-coin-change/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-knapsack-setups/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-multidimensional-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-multiple-choice-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-multiple-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-principles/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-rod-cutting/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-subset-sum/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/exercises/dp-unbounded-knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/lab/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/lab/dp-knapsack-table/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/dynamic-programming/lab/wagner-whitin-lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
</urlset>