Add memory_supply_allocation template (multi-reasoner)

v1/README.md

@@ -24,6 +24,7 @@ This directory contains the templates for v1. Each template folder includes its
 | [fraud-detection](./fraud-detection/) | Multi-reasoner transaction-fraud pipeline: account PageRank (Graph) + high-volume account flags (Rules) feed a GNN binary classifier (Predictive) whose per-transaction scores drive a knapsack investigator-budget MILP (Prescriptive). |
 | [hospital_staffing](./hospital_staffing/) | Explore the tradeoff between overtime cost and patient service level using bi-objective optimization with epsilon constraint. |
 | [humanitarian-aid-supply-chain](./humanitarian-aid-supply-chain/) | Use graph reasoning to analyze a humanitarian aid supply chain network with PageRank and Weighted Degree Centrality to optimize resource distribution strategies. |
+| [memory_supply_allocation](./memory_supply_allocation/) | Monthly rolling-horizon allocation of constrained memory-chip supply across customers with strategic supplier dependencies, named foundries, and raw-material inputs. Four-reasoner chain: predicted supplier capability feeds the optimization, customer-customer paths surface single points of failure, and two what-if scenarios trace supplier-offline and input-shortage cascades. |
 | [money_laundering_motif_detection](./money_laundering_motif_detection/) | Detect three classes of layering motif on the same transaction ledger, each demonstrating a different CSP technique that rules / paths / graph reasoning alone cannot enforce: per-vertex aggregate equality (butterfly), pairwise distinctness over a chosen subset (smurf army), and cardinality on a chosen subset (KYC-mix burst). |
 | [network_flow_planning](./network_flow_planning/) | Plan a multi-tier distribution flow that decides which fulfillment centers to open and how much to ship on every lane to satisfy customer demand at minimum cost. |
 | [patient_cohort_recruitment](./patient_cohort_recruitment/) | Build a clinical-research cohort over a patient knowledge graph: a Graph reasoner closes a kinase-pathway sub-ontology, relational rules lift the closure to per-patient eligibility and coverage facts, and a CSP solver picks K patients whose joint coverage spans enough distinct genes, therapies, and adverse events for the analysis to generalize. |

v1/memory_supply_allocation/data/customers.csv

@@ -0,0 +1,12 @@
+id,name,industry,base_service_floor_pct
+1,Hyperion Compute,Hyperscaler,0.55
+2,Aether Cloud,Hyperscaler,0.55
+3,Helios AI Labs,Hyperscaler,0.55
+4,Astra Devices,Consumer OEM,0.65
+5,Quantum Edge Motors,Automotive,0.75
+6,Nimbus Robotics,Industrial,0.75
+7,Photonic Lithography,Foundry Equipment,0.7
+8,Vertex Test Systems,Foundry Equipment,0.7
+9,Crystal Wafer Tools,Foundry Equipment,0.7
+10,Beacon Memory Holdings,Distribution,0.45
+11,Apex Photonic Components,Precision Optics,0.7