BPPLIB: a library for bin packing and cutting stock problems

Maxence Delorme, Manuel Iori, Silvano Martello*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

38 Citations (Scopus)


The bin packing problem (and its variant, the cutting stock problem) is among the most intensively studied combinatorial optimization problems. We present a library of computer codes, benchmark instances, and pointers to relevant articles for these two problems. The library is available at http://or.dei.unibo.it/library/bpplib. The computer code section includes twelve programs: seven are directly downloadable from the library page, while for the remaining five we provide addresses where they can be obtained or downloaded. Some of the codes for which we provide an original C++ implementation need an integer linear programming solver. For such cases, the library provides two versions: one that uses the commercial solver CPLEX, and one that uses the freeware solver SCIP. The benchmark section provides over six thousands instances (partly coming from the literature and partly randomly generated), together with the corresponding solutions. Instances that are difficult to solve to proven optimality are included. The library also includes a BibTeX file of more than 150 references on this topic and an interactive visual tool to manually solve bin packing and cutting stock instances. We conclude this work by reporting the results of new computational experiments on a number of computer codes and benchmark instances.

Original languageEnglish
Pages (from-to)235-250
Number of pages16
JournalOptimization Letters
Issue number2
Publication statusPublished - 1 Mar 2018
Externally publishedYes


  • Benchmark instances
  • Bin packing
  • Computer codes
  • Cutting stock
  • Surveys


Dive into the research topics of 'BPPLIB: a library for bin packing and cutting stock problems'. Together they form a unique fingerprint.

Cite this