Fast pattern-based algorithms for cutting stock

DOI10.1016/j.cor.2014.03.003zbMath1348.90383OpenAlexW2073601537MaRDI QIDQ337047

João Pedro Pedroso, Filipe Brandão

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)

Related Items (1)

A cutting stock problem in the wood products industry: a two‐stage solution approach

Uses Software

• OR-Library

Cites Work

• Symmetric binary B-trees: Data structure and maintenance algorithms
• An improved typology of cutting and packing problems
• Unnamed Item
• Unnamed Item

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