With inflation skyrocketing, it is possible that one of the best vacation options, for some of my kind readers, is to embark on an adventure with a backpack on their shoulder, which would pose a problem of optimization of resources, since it would be about carrying a maximum of useful things with a minimum of weight. A seemingly simple question, but one that entails enough potential complexity to give name to an important chapter of combinatorial optimization, known precisely as the “knapsack problem”, often designated with the initials KP (from English Knapsack Problem).
