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 ...
The "knapsack problem" is a widespread computing challenge—and no, it doesn't have to do just with literal backpacks. golubovy / iStock Imagine you’re a thief robbing a museum exhibit of tantalizing ...
[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results