Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search

DOI10.1016/j.endm.2014.11.018zbMath1362.90366OpenAlexW1993974091MaRDI QIDQ2631244

Frederico Dusberger, Günther R. Raidl

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.018

zbMATH Keywords

dynamic programmingvariable neighborhood searchcutting stock

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (3)

A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers

Cites Work

• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
• Recent advances on two-dimensional bin packing problems
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Models and algorithms for three-stage two-dimensional bin packing
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Two-Dimensional Finite Bin-Packing Algorithms
• Multistage Cutting Stock Problems of Two and More Dimensions
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search