Practical adaptations of the Gilmore-Gomory approach to cutting stock problems

DOI10.1007/BF01720210zbMath0642.90050OpenAlexW2049904436MaRDI QIDQ1101335

Alan A. Farley

Publication date: 1988

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01720210

zbMATH Keywords

cutting stockdelayed pattern generationmultiple solutions per knapsack problemvaluation of undersupply and oversupplywaste minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Production models (90B30)

Related Items

Exact algorithm for generating two-segment cutting patterns of punched strips, An application of simulated annealing to the cutting stock problem, An analytical model for the container loading problem, A system‐level optimization framework for efficiency and effectiveness improvement of wastewater treatment plants, Limiting the number of each piece in two-dimensional cutting stock patterns, Knowledge based approach to the cutting stock problem, The pallet packing problem for non-uniform box sizes, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, The solution of two-stage guillotine cutting stock problems having extremely varying order demands, Knowledge-based systems for cutting stock problems, A typology of cutting and packing problems, Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations, The cutting stock problem in the canvas industry

Cites Work

• Unnamed Item
• Network flows and non-guillotine cutting patterns
• Fixed charge problems with identical fixed charges
• Trim-loss pattern rearrangement and its relevance to the flat-glass industry
• A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions
• A Linear Programming Approach to the Cutting-Stock Problem
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
• A New Linear Programming Approach to the Cutting Stock Problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• A Note on a Two-dimensional Dynamic Programming Problem
• A Solution of the Rectangular Cutting-Stock Problem
• An Algorithm for Two-Dimensional Cutting Problems
• A Frequency Approach to the One-dimensional Cutting Problem for Carpet Rolls
• A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
• Glass cutting in a small firm
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• A Multistage Solution of the Template-Layout Problem
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• Recursive Computational Procedure for Two-dimensional Stock Cutting