https://github.com/akphi/vanilla.knapsack

Explore different algorithms for Maximum 0-1 Knapsack
https://github.com/akphi/vanilla.knapsack

3sat dynamic-programming fptas greedy-algorithms knapsack np-complete np-hard

Last synced: 4 days ago
JSON representation

Explore different algorithms for Maximum 0-1 Knapsack

• Host: GitHub
• URL: https://github.com/akphi/vanilla.knapsack
• Owner: akphi
• Created: 2017-05-07T14:50:16.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-05-08T01:29:26.000Z (over 7 years ago)
• Last Synced: 2024-11-12T10:14:23.761Z (about 1 month ago)
• Topics: 3sat, dynamic-programming, fptas, greedy-algorithms, knapsack, np-complete, np-hard
• Language: Java
• Homepage:
• Size: 2.76 MB
• Stars: 2
• Watchers: 2
• Forks: 0
• Open Issues: 0

Awesome Lists containing this project