2D Strip Packing

2D Strip Packing

Strip packing problems are a class of 2-dimensional allocation problems that are open dimensional, meaning that all items need to be packed into a strip of a given width so as to minimize its height. The instances used in this example can be found here.


Search algorithm.

Problem Type

MIP (medium)


Castro, P.M., I.E. Grossmann, Hybrid Spatial Representation Models for Strip Packing Problems, Computers and Operations Research, submitted for publication July 2011.

CMU-IBM Cyber-Infrastructure for MINLP collaborative site, at: http://www.minlp.org/index.php.


The general solvers option 'relative optimality tolerance' is set to 0.5. 


A zip file with this example can be downloaded here.