Heuristic for the rectangular strip packing problem with rotation of items
From MaRDI portal
Publication:340330
DOI10.1016/J.COR.2012.11.020zbMath1349.90853OpenAlexW2033271744MaRDI QIDQ340330
Publication date: 14 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.020
strip packingcutting stocksequential groupingsequential heuristic proceduresimple block patternsvalue correction
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (7)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
This page was built for publication: Heuristic for the rectangular strip packing problem with rotation of items
