The **bin packing problem** (in its version **BPP-1**) is the task to assign items with defined weights to a minimal number of bins each of which has the same maximal weight limit. It is a special case of SALBP-1 without precedence restrictions.

The following websites hold relevant resources like data sets and codes:

- BPPLIB by Delorme, Iori and Martello
- Bin Packing Data Sets by Klein and Scholl
- OR Library – Bin Packing by Beasley
- ESICUP – Special Interest Group on Cutting and Packing