Budget-Constrained Selection (0/1 Knapsack)
Look for the unbreakable option combination with the largest total value within a given capacity or budget.
Budget-Constrained Selection (0/1 Knapsack)User manual
- Fill in the parameters or select the file according to the form, and check the unit and format first.
- When capacity 6, choose from three options that occupy 3, 4, 2 and value 5, 6, 3.
- Click the processing button to view the results, you can copy or download and save.
Calculation method and processing rules
Use 0/1 knapsack dynamic programming, selecting each item at most once and reconstructing the selected items and remaining capacity.
scope of use
Up to 100 options, the total capacity is 0 to 10000; the occupancy is a positive integer, the value is a non-negative integer, and the option dependence and repeated purchase are not processed.
Will the input content be saved on the server?
This tool handles input in the browser, and does not upload files or form content. Typing practice scores are only saved in the native browser.
Why may the result be different from other tools?
Up to 100 options, the total capacity is 0 to 10000; the occupancy is a positive integer, the value is a non-negative integer, and the option dependence and repeated purchase are not processed. Please compare the input unit, rounding method, applicable rules and data version first.