Is there an optimized algorithm for online bin packing problem with a very small number of bin (less than ten) and variable number of items (30-100)? (lemmy.ml)

submitted 6 months ago by notTheCat@lemmy.ml to c/programming@programming.dev

1 comments fedilink hide all child comments

I've read some of this article, it doesn't propose any algorithms for my case, I'm super positive about these boundaries.

If there is an offline algorithm that is optimized for my case it could help me around.

top 1 comments

sorted by: hot top controversial new old

[-] Rogue@feddit.uk 5 points 6 months ago

I don't know about the specific question you ask but I've found Google OR Tools to be useful in the past: https://developers.google.com/optimization/pack/bin_packing

this post was submitted on 26 Apr 2024

6 points (87.5% liked)

Programming

17314 readers

34 users here now

Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!

Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.

Hope you enjoy the instance!

Rules

Follow the programming.dev instance rules
Keep content related to programming in some way
If you're posting long videos try to add in some form of tldr for those who don't want to watch videos

Wormhole

Follow the wormhole through a path of communities !webdev@programming.dev

founded 1 year ago

MODERATORS

snowe@programming.dev

Ategon@programming.dev

MaungaHikoi@lemmy.nz