Online Tool Store
Rugzak-oplosser
Los rugzakprobleem op—selecteer items per gewicht en waarde om waarde in capaciteitsbeperking te maximaliseren.
🔒 Deze tool werkt volledig in je browser. Je bestanden worden nooit naar een server geüpload.
Math & Science
Knapsack Solver
Frontend preview — no upload or external service.
Optimal selection
12 kg capacity, 14 candidate items: optimal set is 7 items totalling 11.8 kg and 268 value. The greedy value-per-kg choice would have scored 251.
How Rugzak-oplosser works
- Open Rugzak-oplosser and review the example state before entering your own values.
- Enter or select the information needed for Rugzak-oplosser.
- Review the result and adjust the inputs if you want to compare another case.
Solve the 0/1 knapsack problem — pick the highest-value set of items that fits a weight or budget limit — with the chosen set explained. The interactive workspace runs in your browser, so you can review the result without creating an account.
FAQ
What is Rugzak-oplosser used for?
Solve the 0/1 knapsack problem — pick the highest-value set of items that fits a weight or budget limit — with the chosen set explained.
Do I need an account?
No. The tool is available directly in the browser without an account or sign-up.
What should I do if the result looks unexpected?
Check the entered values and compare them with the guidance shown in Rugzak-oplosser. Use the result as a planning aid and verify important decisions independently.