<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/autovalutazione/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/indice/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/materiale/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/algoritmi-specializzati/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/algoritmi-specializzati/dsatur-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/algoritmi-specializzati/knapsack-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/asymmetric-travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/bin-packing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/bounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/capacitated-lot-sizing-with-constant-capacity/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/capacitated-lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/clique-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/coin-change-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/coloring-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/cutting-stock-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/edge-weighted-maximum-clique-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/hamiltonian-cycle-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/knapsack-problem-with-setups/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/knapsack-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/lot-sizing-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/lot-sizing-with-initial-stock/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/lot-sizing-with-overtime/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/lot-sizing-with-several-products-and-setup-times/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/lot-sizing-with-unsatisfied-demand/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/maximum-clique-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/maximum-stable-set-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/metric-travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/miscellaneous-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/multidimensional-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/multiple-choice-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/multiple-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/packing-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/rod-cutting-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/routing-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/scheduling-on-a-fixed-number-of-identical-machines/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/scheduling-on-identical-parallel-machines/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/scheduling-on-parallel-machines-with-different-speeds/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/scheduling-on-unrelated-parallel-machines/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/scheduling-problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/subset-sum-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/travelling-salesman-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/unbounded-knapsack-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/uncapacitated-lot-sizing-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/vertex-coloring-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/catalogo/vertex-weighted-maximum-clique-problem/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/bin-packing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/bin-packing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/clique-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/clique/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/coloring-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/coloring/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/combinatorial-optimization/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/dsatur-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/knapsack-branch-and-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/knapsack-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/lot-sizing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/pcmax-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/pcmax/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/tsp-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/esercizi/tsp/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/bin-packing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/bin-packing-formulations/un-modello-pli-per-il-problema-del-bin-packing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/bin-packing-formulations/un-modello-pli-per-il-problema-del-cutting-stock/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/clique-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/clique-formulations/modelli-pli-per-le-varianti-pesate/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/clique-formulations/un-modello-pli-per-il-problema-della-clique-massima-la-formu/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/coloring-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/coloring-formulations/un-modello-pli-per-il-problema-della-colorazione-dei-vertici/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-degli-zaini-multipli/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-del-subset-sum/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-dello-zaino-0-1/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-dello-zaino-a-scelta-multipla/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-dello-zaino-con-setup/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-dello-zaino-illimitato/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-dello-zaino-limitato/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/knapsack-formulations/un-modello-pli-per-il-problema-dello-zaino-multidimensionale/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/lot-sizing-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/lot-sizing-formulations/modelli-pli-per-il-problema-di-lot-sizing-capacitato/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/lot-sizing-formulations/modelli-pli-per-le-varianti/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/pcmax-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/pcmax-formulations/un-modello-pli-per-il-problema-di-scheduling-su-macchine-par/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/tsp-formulations/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/tsp-formulations/modelli-pli-per-il-problema-del-commesso-viaggiatore/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/formulazioni/tsp-formulations/modelli-pli-per-il-tsp-metrico-e-asimmetrico/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/laboratorio/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/laboratorio/branch-and-bound-dsatur/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/laboratorio/branch-and-bound-zaino/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/laboratorio/zaino-forza-bruta/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/laboratorio/zaino-rilassamento-bound/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/problems/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/bin-packing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/bin-packing/il-problema-del-bin-packing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/bin-packing/il-problema-del-cutting-stock/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/clique/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/clique/il-problema-della-clique-massima/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/clique/varianti-pesate/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/coloring/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/coloring/il-problema-della-colorazione-dei-vertici/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/combinatorial-optimization/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/combinatorial-optimization/bound-primali-bound-duali-e-gap/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/combinatorial-optimization/categorie-di-problemi-di-ottimizzazione-combinatoria/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/combinatorial-optimization/cenni-di-complessita-computazionale/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/combinatorial-optimization/contare-le-soluzioni/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/combinatorial-optimization/esplosione-combinatoria-e-forza-bruta/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/combinatorial-optimization/problemi-di-ottimizzazione-combinatoria/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-degli-zaini-multipli/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-del-subset-sum/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-dello-zaino-0-1/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-dello-zaino-a-scelta-multipla/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-dello-zaino-con-setup/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-dello-zaino-illimitato/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-dello-zaino-limitato/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/knapsack/il-problema-dello-zaino-multidimensionale/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/lot-sizing/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/lot-sizing/il-problema-del-lot-sizing-capacitato/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/lot-sizing/varianti/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/pcmax/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/pcmax/scheduling-su-macchine-parallele-identiche/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/tsp/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/tsp/il-problema-del-commesso-viaggiatore/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-di-ottimizzazione-combinatoria/tsp/varianti-tsp-metrico-e-tsp-asimmetrico/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
    <url>
         <loc>https://fabiofurini.github.io/ottimizzazione-combinatoria/problemi-scelti/</loc>
         <lastmod>2026-11-21</lastmod>
    </url>
</urlset>