BPPLIB

Library of bin packing and cutting stock problem instances.

Also called: BPPLIB · Bin Packing Problem Library

A library for one-dimensional bin packing (BPP) and cutting stock (CSP) by Delorme, Iori & Martello (2018). It gathers benchmark instances from many sources alongside a survey of exact and heuristic methods, implementation code, and reported computational results. It links as a direct benchmark of 1D Cutting Stock, which shares the same pattern/configuration formulation; as peer-reviewed work it is treated at evidence grade A.

Claims & evidence

Every relationship is a claim with an evidence grade; applicable problem-to-problem relationships also carry an equivalence level. See the evidence policy.

A–X describes evidence reliability; E0–E4 describes mathematical similarity between problems. The two axes are independent.

Relationships to this entry 1

direct benchmark
1D Cutting Stock to BPPLIB
BPPLIB is a direct benchmark providing instances for bin packing and cutting stock problems.
EvidenceA · Peer-reviewed / official
Sources
- Source grade: A — Peer-reviewed / officialBPPLIB: a library for bin packing and cutting stock problems
  Citation details
  Delorme, M., Iori, M., Martello, S. (2018). BPPLIB: a library for bin packing and cutting stock problems. Optimization Letters 12:235-250.

Relationships to this entry
Relationship	Claim	Evidence	Equiv.	Sources
direct benchmark 1D Cutting Stock to BPPLIB	BPPLIB is a direct benchmark providing instances for bin packing and cutting stock problems.	A · Peer-reviewed / official	—	Source grade: A — Peer-reviewed / officialBPPLIB: a library for bin packing and cutting stock problems Citation details Delorme, M., Iori, M., Martello, S. (2018). BPPLIB: a library for bin packing and cutting stock problems. Optimization Letters 12:235-250.