A Solution of the Rectangular Cutting-Stock Problem

DOI10.1109/TSMC.1976.5408780zbMath0322.90018OpenAlexW2082594743MaRDI QIDQ4085466

Michael Adamowicz, Antonio Albano

Publication date: 1976

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsmc.1976.5408780

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Related Items (13)

Practical adaptations of the Gilmore-Gomory approach to cutting stock problems ⋮ Solving nesting problems with non-convex polygons by constraint logic programming ⋮ An approach to two-dimensional cutting stock problems ⋮ An approximation algorithm for solving unconstrained two-dimensional knapsack problems ⋮ Nesting planning based on production priorities and technological efficiency ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ The trim-loss and assortment problems: A survey ⋮ Knowledge based approach to the cutting stock problem ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ Packing problems ⋮ New approaches for the nesting of two-dimensional shapes for press tool design ⋮ Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations ⋮ Network flows and non-guillotine cutting patterns

This page was built for publication: A Solution of the Rectangular Cutting-Stock Problem