3D Bin Packing Problem
The 3D Bin Packing Problem (3D-BPP) is one of the most frequent problems in warehousing and logistics. Its solution is filling a container (a box or pallet) with items as closely to each other as possible to minimize the number of required containers.
3D Bin Packing Problem endpoints
| Method | Endpoint | Description |
|---|---|---|
| POST |
go / |
This API implementation is used to solve 3D container packing problems for shipping carton calculation. |
3D Bin Packing Problem pricing
| Plan | Price | Rate limit | Quotas |
|---|---|---|---|
| BASIC | Free | 2 / second |
|
| PRO | $1 / month | 2 / second |
|
| ULTRA | $4.99 / month | 2 / second |
|
| MEGA Recommended | $14.99 / month | 5 / second |
|