Timeline for Partition a set of n integers into m subsets in a way that the maximum subset sum is minimized
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2021 at 11:24 | comment | added | gnasher729 | It's quite similar to bin packing. Bin packing can use some tricks for handling very small and very large item, and they can be adapted. | |
| Nov 15, 2021 at 11:03 | comment | added | Fish_n_Chips | Thank you for the explanation. But is there a better approach than brute force? I mean can this problem be solved in fewer steps compared to an exhaustive search? | |
| Nov 15, 2021 at 10:22 | history | answered | Steven | CC BY-SA 4.0 |