{"version":"1.0","type":"link","title":"Strip packing problem - Newikis","description":"The strip packing problem is a 2-dimensional geometric minimization problem. Given a set of axis-aligned rectangles and a strip of bounded width and infinite height, determine an overlapping-free packing of the rectangles into the strip, minimizing its height. This problem is a cutting and packing…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}