A search strategy for the one-size assortment problem

DOI10.1016/0377-2217(94)90211-9zbMath0803.90107OpenAlexW2010166637MaRDI QIDQ1330558

Horacio Hideki Yanasse

Publication date: 21 July 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90211-9

zbMATH Keywords

heuristicscutting stockassortmentoptimal length of a board

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Two-dimensional Cutting Stock with Multiple Stock Sizes
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

This page was built for publication: A search strategy for the one-size assortment problem