Hi,
I have a set of unique items that I have to assign to specified locations. The number of locations is determined by the sum of the items' values, rounded up to the closest integer. See for an example below:
In the above example my sum equals to 4,79, which means I need to distribute to 5 locations. I want to find the best combination that will allow me to distribute the highest amount of items to one location. In other words, a combination of items, the sum of values of which is closest but not greater than 1.
Any suggestions would be greatly appreciated.
I have a set of unique items that I have to assign to specified locations. The number of locations is determined by the sum of the items' values, rounded up to the closest integer. See for an example below:
| Item | Value |
| A | 0,11 |
| B | 0,22 |
| C | 0,44 |
| D | 0,44 |
| E | 0,67 |
| F | 0,33 |
| G | 0,25 |
| H | 0,5 |
| I | 0,5 |
| J | 0,33 |
| K | 0,22 |
| L | 0,67 |
| M | 0,11 |
| Sum | 4,79 |
In the above example my sum equals to 4,79, which means I need to distribute to 5 locations. I want to find the best combination that will allow me to distribute the highest amount of items to one location. In other words, a combination of items, the sum of values of which is closest but not greater than 1.
Any suggestions would be greatly appreciated.
