Benchmark
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.
No claims recorded yet.