Fast pattern-based algorithms for cutting stock

DOI10.1016/J.COR.2014.03.003zbMATH Open1348.90383OpenAlexW2073601537MaRDI QIDQ337047FDOQ337047

Authors Filipe Brandão, João Pedro Pedroso

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2014.03.003

zbMATH Keywords

cutting stockbest fit decreasingfirst fit decreasing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1179834
• An algorithm for the determination of optimal cutting patterns
• Pattern minimisation in cutting stock problems
• An algorithm for a cutting stock problem on a strip
• Efficient algorithm for the constrained two-dimensional cutting stock problem
• An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
• scientific article; zbMATH DE number 710068
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• Pattern reduction in one-dimensional cutting stock problems
• Development of some cutting stock algorithms

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An improved typology of cutting and packing problems
• Introduction to algorithms
• Symmetric binary B-trees: Data structure and maintenance algorithms

Cited in

(4)

• An algorithm for the determination of optimal cutting patterns
• A cutting stock problem in the wood products industry: a two‐stage solution approach
• Fast heuristic for constrained homogenous T-shape cutting patterns
• scientific article; zbMATH DE number 710068 (Why is no real title available?)

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Fast pattern-based algorithms for cutting stock

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337047)