BPPLIB
Library of bin packing and cutting stock problem instances.
Also called: BPPLIB · Bin Packing Problem Library
Last verified: 2026-05-27
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 equivalence level and an evidence grade. See the evidence policy.
No claims recorded yet.
Neighborhood
Direct graph neighbors. Toggle depth to expand.
See also
Not directly linked, but conceptually close — by the connections and descriptions they share.
- 2D Bin PackingFormal problem1 connections in common
- Variable-Sized Bin PackingFormal problem1 connections in common
- Wäscher TypologyConcept1 connections in common
- Integer Linear ProgrammingMethod1 connections in common
- 0/1 Knapsack ProblemFormal problem1 connections in common
- Paper Roll SlittingApplication problem1 connections in common