The Card-Players' Algorithm, developed by Akash Nag in 2017, is a fast heuristic algorithm for solving high-density variants of the subset-sum problem, which is a NP-complete problem. This repository provides a Java implementation for this algorithm.
If you use this code or find this useful, please cite:
Akash Nag, "A Fast Heuristic Algorithm for Solving High-Density Subset-Sum Problems", International Journal of Mathematical Sciences & Computing (IJMSC) Vol. 3(2), pp:55-61, 2017.
The paper can be found here.
This code is licensed under the MIT License. Copyright © Akash Nag.