dvdoug / Boxpacker
Licence: mit
4D bin packing / knapsack problem solver
Stars: ✭ 436
BoxPacker
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.
Note that the project description data, including the texts, logos, images, and/or trademarks,
for each open source project belongs to its rightful owner.
If you wish to add or remove any projects, please contact us at [email protected].