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 links provide relevant resources like data sets and codes:

References:

  • Scholl, A.; Klein, R.; J├╝rgens, C. (1997): BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 24, 627-645.
  • Delorme, M.; Iori, M.; Martello, S. (2018): BPPLIB: A library for bin packing and cutting stock problems. Optimization Letters 12/2, 235-250.