WARNING: THIS SITE IS A MIRROR OF GITHUB.COM / IT CANNOT LOGIN OR REGISTER ACCOUNTS / THE CONTENTS ARE PROVIDED AS-IS / THIS SITE ASSUMES NO RESPONSIBILITY FOR ANY DISPLAYED CONTENT OR LINKS / IF YOU FOUND SOMETHING MAY NOT GOOD FOR EVERYONE, CONTACT ADMIN AT ilovescratch@foxmail.com
Skip to content

dvdoug/BoxPacker

Repository files navigation

BoxPacker

Build Status Scrutinizer Code Quality Download count Current version Documentation

An implementation of the "4D" bin packing/knapsack problem i.e. given a list of items, how many boxes do you need to fit them all in taking into account physical dimensions and weights.

Especially useful for e.g. e-commerce contexts when you need to know box size/weight to calculate shipping costs, or even just want to know the right number of labels to print.

See documentation for more details.

License

BoxPacker is MIT-licensed.

About

4D bin packing / knapsack problem solver

Topics

Resources

License

Stars

Watchers

Forks

Sponsor this project

 

Contributors 12