Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
From MaRDI portal
Publication:3883899
DOI10.1287/opre.28.4.1001zbMath0441.90066OpenAlexW2032709543MaRDI QIDQ3883899
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.4.1001
knapsack problemcomputational experiencemodificationsGilmore-Gomory cutting stock algorithmreduction of rounding problems
Related Items (17)
Practical adaptations of the Gilmore-Gomory approach to cutting stock problems ⋮ Cardinality Constrained Decomposition ⋮ In situ column generation for a cutting-stock problem ⋮ An approximation algorithm for solving unconstrained two-dimensional knapsack problems ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Cutting stock problems and solution procedures ⋮ Composite stock cutting through simulated annealing ⋮ Limiting the number of each piece in two-dimensional cutting stock patterns ⋮ Knowledge based approach to the cutting stock problem ⋮ Packing problems ⋮ Solving a combined cutting-stock and lot-sizing problem with a column generating procedure ⋮ The stochastic trim-loss problem ⋮ The solution of two-stage guillotine cutting stock problems having extremely varying order demands ⋮ One-dimensional cutting stock decisions for rolls with multiple quality grades ⋮ The cutting stock problem in the canvas industry ⋮ Trim-loss pattern rearrangement and its relevance to the flat-glass industry ⋮ Production planning and scheduling for an integrated container company
This page was built for publication: Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
