<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/downloads/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/full-index/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/self-assessment/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/asymmetric-travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/bin-packing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/bounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/capacitated-lot-sizing-with-constant-capacity/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/capacitated-lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/clique-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/coin-change-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/coloring-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/cutting-stock-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/edge-weighted-maximum-clique-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/hamiltonian-cycle-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/knapsack-problem-with-setups/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/knapsack-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/lot-sizing-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/lot-sizing-with-initial-stock/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/lot-sizing-with-overtime/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/lot-sizing-with-several-products-and-setup-times/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/lot-sizing-with-unsatisfied-demand/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/maximum-clique-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/maximum-stable-set-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/metric-travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/miscellaneous-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/multidimensional-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/multiple-choice-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/multiple-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/packing-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/rod-cutting-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/routing-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/scheduling-on-a-fixed-number-of-identical-machines/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/scheduling-on-identical-parallel-machines/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/scheduling-on-parallel-machines-with-different-speeds/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/scheduling-on-unrelated-parallel-machines/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/scheduling-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/subset-sum-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/unbounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/uncapacitated-lot-sizing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/vertex-coloring-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/catalogue/vertex-weighted-maximum-clique-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/bin-packing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/bin-packing/the-bin-packing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/bin-packing/the-cutting-stock-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/clique/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/clique/the-maximum-clique-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/clique/weighted-variants/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/coloring/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/coloring/the-vertex-coloring-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/combinatorial-optimization/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/combinatorial-optimization/a-glimpse-of-computational-complexity/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/combinatorial-optimization/categories-of-combinatorial-optimization-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/combinatorial-optimization/combinatorial-explosion-and-brute-force/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/combinatorial-optimization/combinatorial-optimization-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/combinatorial-optimization/counting-the-solutions/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/combinatorial-optimization/primal-bounds-dual-bounds-and-gap/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-0-1-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-bounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-knapsack-problem-with-setups/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-multidimensional-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-multiple-choice-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-multiple-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-subset-sum-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/knapsack/the-unbounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/lot-sizing/the-capacitated-lot-sizing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/lot-sizing/variants/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/pcmax/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/pcmax/scheduling-on-identical-parallel-machines/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/tsp/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/tsp/the-travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/combinatorial-optimization-problems/tsp/variants-metric-and-asymmetric-tsp/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/bin-packing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/bin-packing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/clique-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/clique/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/coloring-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/coloring/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/combinatorial-optimization/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/dsatur-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/knapsack-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/knapsack-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/lot-sizing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/pcmax-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/pcmax/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/tsp-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/exercises/tsp/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/bin-packing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/bin-packing-formulations/an-ilp-model-for-the-bin-packing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/bin-packing-formulations/an-ilp-model-for-the-cutting-stock-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/clique-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/clique-formulations/an-ilp-model-for-the-maximum-clique-problem-the-edge-formula/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/clique-formulations/ilp-models-for-the-weighted-variants/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/coloring-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/coloring-formulations/an-ilp-model-for-the-vertex-coloring-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-0-1-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-bounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-knapsack-problem-with-setups/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-multidimensional-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-multiple-choice-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-multiple-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-subset-sum-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/knapsack-formulations/an-ilp-model-for-the-unbounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/lot-sizing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/lot-sizing-formulations/ilp-models-for-the-capacitated-lot-sizing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/lot-sizing-formulations/ilp-models-for-the-variants/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/pcmax-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/pcmax-formulations/an-ilp-model-for-the-scheduling-on-identical-parallel-machin/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/tsp-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/tsp-formulations/ilp-models-for-the-metric-and-asymmetric-tsp/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/formulations/tsp-formulations/ilp-models-for-the-travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/lab/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/lab/dsatur-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/lab/knapsack-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/lab/kp-brute-force/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/lab/kp-lp-relaxation-bounds/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/selected-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/specialized-algorithms/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/specialized-algorithms/dsatur-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/combinatorial-optimization/specialized-algorithms/knapsack-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
</urlset>