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.1048860zbMATH Open1381.90059OpenAlexW2238658459MaRDI QIDQ2811482FDOQ2811482
Yaodong Cui, Qiulian Chen, Yan Chen
Publication date: 10 June 2016
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1048860
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- An improved typology of cutting and packing problems
- 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
- Heuristic for the rectangular strip packing problem with rotation of items
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- 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
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- 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
- 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 bounds for two-dimensional level packing problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Reducing the number of cuts in generating three-staged cutting patterns
- Sequential heuristic for the two-dimensional bin-packing problem
Cited In (1)
Uses Software
Recommendations
- [NO TITLE AVAILABLE] π π
- 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 π π
- Title not available (Why is that?) π π
- 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 π π
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)