Timeline for How can I improve my algorithm for finding optimally balanced P-way partitioning of array
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 21, 2020 at 20:51 | vote | accept | Filip A | ||
| May 19, 2020 at 1:26 | comment | added | John L. | Here is my code at replt.it. For N = 100000, P=100, weights randomly selected between 1 and 1000000, it takes a fraction of a second to compute. | |
| May 19, 2020 at 1:25 | history | edited | John L. | CC BY-SA 4.0 |
Major update.
|
| May 18, 2020 at 16:39 | comment | added | Filip A | Thanks for the elaborate response. I did make a variation of Szymons suggestion that would iterate the Greedy algorithm and it works ok, but I'm not sure it guarantees the optimal solution. I'll try out the binary search version when I find time this week and accept your answer when I have a working implementation (I see no reason why it shouldn't work). | |
| May 17, 2020 at 23:15 | history | answered | John L. | CC BY-SA 4.0 |