C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction

DOI10.1080/10556780903420531zbMath1226.90087OpenAlexW1998842469MaRDI QIDQ3093039

Yaodong Cui, Zhi-yong Liu

Publication date: 12 October 2011

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780903420531

zbMATH Keywords

cutting stockone-dimensional cuttingpattern reductionlook-ahead strategy

Mathematics Subject Classification ID

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

Related Items (8)

Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns

This page was built for publication: C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction