A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
From MaRDI portal
Publication:1871643
DOI10.1007/s00291-002-0093-3zbMath1012.90032OpenAlexW2015238666MaRDI QIDQ1871643
José Manuel Tamarit, Antonio Parajón, Ramón Alvarez-Valdés
Publication date: 4 May 2003
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-002-0093-3
Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (14)
Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Heuristic algorithm for a cutting stock problem in the steel bridge construction ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Determining the best shipper sizes for sending products to customers ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
This page was built for publication: A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
