Bin Packing with Item Fragmentation - Benchmarks and results

• Our results are included in the following papers:
  • M. Casazza, A. Ceselli ``Mathematical programming algorithms for bin packing problems with item fragmentation'', Computers and Operations Research 46 (2014)
  • M. Casazza, A. Ceselli ``Exactly solving packing problems with fragmentation'', Computers and Operations Research 75 (2016)
• Our full Datasets can be found at the following links: small size (up to 20 items) and large size (from 20 to 100 items) . A README.txt file inside each archive explains the structure of data.
• Three spreadsheets containing our CPLEX and branch-and-price , upper bounds, and heuristics detailed computational results for the 2014 paper are available at the previous links.