A Solution of the Rectangular Cutting-Stock Problem

DOI10.1109/TSMC.1976.5408780MaRDI QIDQ4085466zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(14)

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

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

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