This repository contains a set of 1787 feasible instances for the 0-1 Knapsack Problem with Group Fairness. The instances are in folder instances and the generator used to create them is in folder ...

Abstract: The knapsack problem is known as a NP-hard problem. There is a dynamic programming solution for this problem which is called the 0–1 knapsack. Firefly's innovative optimization algorithm is ...

1 ENS-Hassan II University, Laboratory of Mathematics and Applications, Casablanca, Morocco. 2 EST-Hassan I University, Laboratory of Analysis, Modeling Systems and Decision Support, Berrechid, ...

This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight ...

Sharethrough is getting into the boom in QR codes, introducing its own offering for connected TV. The codes can be added dynamically as connected TV ads are bought programmatically through the ...