Skip to content

4D bin packing / knapsack problem solver

License

Notifications You must be signed in to change notification settings

radamich/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

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • PHP 89.7%
  • TypeScript 5.8%
  • Gherkin 4.4%
  • JavaScript 0.1%