Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
From MaRDI portal
Publication:2811482
DOI10.1080/10556788.2015.1048860zbMath1381.90059OpenAlexW2238658459MaRDI QIDQ2811482
Yaodong Cui, Qiulian Chen, Yan Chen
Publication date: 10 June 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1048860
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- Heuristic for the rectangular strip packing problem with rotation of items
- Reducing the number of cuts in generating three-staged 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
- Models and bounds for two-dimensional level packing problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Sequential heuristic for the two-dimensional bin-packing problem
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- Exact algorithms for large-scale unconstrained two and three staged cutting problems