Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
From MaRDI portal
Publication:2811482
Recommendations
- The sequential value correction method for the two-dimensional irregular cutting stock problem
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- A Two-phase Heuristic for the Two-dimensional Cutting-stock Problem
- Establishing the optimality of sequencing heuristics for cutting stock problems
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- scientific article; zbMATH DE number 7708784
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
Cites work
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An improved typology of cutting and packing problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Heuristic for the rectangular strip packing problem with rotation of items
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- Models and algorithms for three-stage two-dimensional bin packing
- Models and bounds for two-dimensional level packing problems
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- Reducing the number of cuts in generating three-staged cutting patterns
- Sequential heuristic for the two-dimensional bin-packing problem
- Setup and open-stacks minimization in one-dimensional stock cutting
Cited in
(3)
This page was built for publication: Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811482)