Suggested contributions

[erelsgl]

Hi, are you still working on this project?

I have some code for k-way number partitioning, as well as for some related problems such as bin-packing and bin-covering. Will you be interested in adding them?

[fuglede]

Yep, it's active. And I think there's room for more functionality.

• The tiny bit of functionality that's already in here is also for multiway number partitioning (which happened to be what I needed myself). One thing that could be useful would be having more alternatives to KK and CKK (included in Add the complete karmarkar-karp algorithm #1), perhaps taking inspiration from this SO post. Or perhaps something based on the MILP-solvers out there. I'm sitting on a few NumPy/Numba implementations for KK as well that give speed-ups in certain cases. I'd also consider PyO3/Cython if the packaging story didn't come with so much maintenance.
• For bin-packing and friends there are some established packages already -- e.g. binpacking -- and it would probably be less confusing/more efficient if further improvements went into that.

[erelsgl]

OK. I sent a PR that finds an exact solution using integer linear programming. One advantage of this approach is that it can be easily generalized, for example, to finding a partition with the smallest sum of the two largest parts; adding multiplicity constraints; etc.

I asked at the binpacking project and it seems they are not interested in contributions.

[fuglede]

Thanks, looks solid! I'm bit preoccupied these days but I'll make sure to dig in once time permits.