Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
From MaRDI portal
Publication:2356096
DOI10.1016/j.ejor.2013.05.042zbMath1317.90326OpenAlexW2018127478MaRDI QIDQ2356096
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.05.042
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
Uses Software
Cites Work
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
- Reducing the number of cuts in generating three-staged cutting patterns
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- 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
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- Models and bounds for two-dimensional level packing problems
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- An improved typology of cutting and packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
- A Linear Programming Approach to the Cutting-Stock Problem
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
This page was built for publication: Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
