Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
From MaRDI portal
Publication:1768600
DOI10.1023/B:JOCO.0000021938.49750.91zbMath1136.90495OpenAlexW1967277921MaRDI QIDQ1768600
Publication date: 15 March 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:joco.0000021938.49750.91
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (13)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study ⋮ A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects ⋮ Improved state space relaxation for constrained two-dimensional guillotine cutting problems ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ A recursive algorithm for constrained two-dimensional cutting problems
This page was built for publication: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
