| Webster's Online Dictionary |
| Expressions | Definition | ||
| Bin packing problem | In computational complexity theory, the bin packing problem is a combinatorial NP-hard problem. In it, objects of different volumes must be packed into a finite number of bins of capacity V in a way that minimizes the number of bins used. (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
| Expressions | Domain | Definition | |
| Bin packing problem | Math | Determine how to put the most objects in the least number of fixed space bins. More formally, find a partition and assignment of a set of objects such that a constraint is satisfied or an objective function is minimized (or maximized). There are many variants, such as, 3D, 2D, linear, pack by volume, pack by weight, minimize volume, maximize value, fixed shape objects, etc. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
