New heuristic and interactive approaches to 2D rectangular strip packing
From MaRDI portal
Publication:5718631
DOI10.1145/1064546.1083322zbMath1137.68579OpenAlexW2100625291MaRDI QIDQ5718631
Neal Lesh, A. McMahon, Joe Marks, Michael Mitzenmacher
Publication date: 16 January 2006
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064546.1083322
Related Items (14)
Exhaustive approaches to 2D rectangular perfect packings ⋮ An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules ⋮ An exact strip packing algorithm based on canonical forms ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped ⋮ Reactive GRASP for the strip-packing problem ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ Human-guided search ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ Persistent Computations of Turing Machines ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem ⋮ Packing solar cells on a roof ⋮ Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
Uses Software
This page was built for publication: New heuristic and interactive approaches to 2D rectangular strip packing
