New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

failing to find optimal solution #11

Open

sjelting opened this issue Apr 17, 2024 · 0 comments

sjelting commented Apr 17, 2024

bn l=1870 d=1200 h=1000 w=1000000
12 times it: l=426 d=795 h=390 w=1.12

those 12 items trivially fit into the bn, but the solution can only pack 8 in one bn and adds a second bin. why?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment