This repository contains all the supplementary material accompanying the paper Algorithms for the Bin Packing Problem with Overlapping Items, to appear in Computers & Industrial Engineering (full reference at https://authors.elsevier.com/tracking/article/details.do?aid=4952&jid=CAIE&surname=Grange). It comprises:

• A dataset of 10986 random instances distributed in 1831 JSON files.
• The Python 2.7 implementation of our algorithms, partly ported to Python 3.3 by Damian Yerrick. This code was mainly written for internal use. It is provided as is, without any guarantee, maintenance or further support.
• Our numerical analysis of this dataset. This so-called Jupyter Notebook is self-contained and interactive. Reevaluating its cells, testing another ideas or carrying out your own experiments may require some installations on your machine. We recommend using the Anaconda Distribution, which installs Python, the Jupyter Notebook, and other commonly used packages for scientific computing and data science.
• The MIT License.
• This document.

The whole repository can either be retrieved as a zipped archive Clone or download / Download ZIP, or cloned on your computer if you intend to keep it up to date without downloading the whole thing each time and writing over your own changes.

To use this pagination solver in your own Python programs, add solve_overload_and_remove_presort.py and solver_tools.py to your project, and then use it as illustrated in the example solver_tools.py.