Updated World Record (24,381 pts) for Multidimensional Knapsack Problem: Chu & Beasley mknapcb1 (Instance 1)

UPDATE (2026-01-21): A new iteration of the engine (The Annet Standard™ Enterprise Edition) has further optimized the solution density, achieving a new verified score of 24,381. Performance Delta: Previous BKS (Academic): 23,713 Previous Annet Record (v1.0): 24,138 (+1.79%) Previous Annet Record (v2.0): 24,373 (+2.78%) Actual Annet Record (v3.0): 24,381 (+2,82%) Technical Note: This result was achieved using a fully deterministic run on a single CPU core in under 45 seconds. The solution vector provided in Annet_Standard_Record_24381.txt has been verified against the strict constraints of the mknapcb1 instance (contained in the dataset file). Original Description below: This repository contains the solution vector establishing a world record for the first instance of the classic Chu & Beasley benchmark.