A heuristic solution of the rectangular cutting stock problem

DOI10.1093/comjnl/23.4.338zbMath0435.68053OpenAlexW1999658716MaRDI QIDQ3875358

No author found.

Publication date: 1980

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/23.4.338

zbMATH Keywords

Knapsack problemtree search approachM-partition problem

Mathematics Subject Classification ID

Integer programming (90C10) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

The knapsack problem with generalized upper bounds ⋮ An approach to two-dimensional cutting stock problems

This page was built for publication: A heuristic solution of the rectangular cutting stock problem