Abstract:The two-dimensional strip packing problem is to pack a given set of rectangles into a strip with a given width and infinite height so as to minimize the required height of the packing. From the computational point of view, the strip packing problem is an NP-hard problem. With the B*-tree representation, this paper first presents a heuristic packing strategy which evaluates the positions used by the rectangles. Then an effective local search method is introduced to improve the results and a heuristic algorithm … Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.