Multistage Cutting Stock Problems of Two and More Dimensions

DOI10.1287/opre.13.1.94zbMath0128.39601MaRDI QIDQ5336847

Ralph E. Gomory, Paul C. Gilmore

Publication date: 1965

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cb4516da7987fe82f75fe114eadd9b01ceec562e

zbMATH Keywords

operations research

Related Items

Relaxation techniques applied to some loading problems, Analysis and modelling of a production line in a corrugated box factory, A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks, The computer as an aid to physical distribution management, Recent advances on two-dimensional bin packing problems, Network flows and non-guillotine cutting patterns, Fixed charge problems with identical fixed charges, A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing, Heuristics for sequencing cutting patterns, The combined cutting stock and lot-sizing problem in industrial processes, The constrained compartmentalised knapsack problem, Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem, Two-stage general block patterns for the two-dimensional cutting problem, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Characterization and modelling of guillotine constraints, T-shape homogeneous block patterns for the two-dimensional cutting problem, A coupling cutting stock-lot sizing problem in the paper industry, A new heuristic algorithm for cuboids packing with no orientation constraints, Heuristic algorithm for a cutting stock problem in the steel bridge construction, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, Bidimensional packing by bilinear programming, 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 new enumeration scheme for the knapsack problem, Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, An analytical model for the container loading problem, Nesting planning based on production priorities and technological efficiency, The trim-loss and assortment problems: A survey, Cutting stock problems and solution procedures, An and-or-graph approach for two-dimensional cutting problems, 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, Stock cutting to minimize cutting length, The solution of two-stage guillotine cutting stock problems having extremely varying order demands, A recursive exact algorithm for weighted two-dimensional cutting, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems, Integrated defect detection and optimization for cross cutting of wooden boards, An algorithm for the 2D guillotine cutting stock problem, Solution procedures for cutting lumber into furniture parts, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, On the effectivity of gradient methods for cutting stock problems, Effective methods for a container packing operation, A branch-and-price algorithm for solving the cutting strips problem, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, Improved heuristics for sequencing cutting patterns, The cutting stock problem in a hardboard industry: A case study., Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study, Approximate algorithms for constrained circular cutting problems, On the two-dimensional knapsack problem, Row and column generation technique for a multistage cutting stock problem, The two-dimensional cutting stock problem revisited, An improved version of Wang's algorithm for two-dimensional cutting problems, One-dimensional cutting stock decisions for rolls with multiple quality grades, Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations, The cutting stock problem in the canvas industry, A computer-based heuristic for packing pooled shipment containers, Load planning for shipments of low density products, Heuristics for the container loading problem, Two-dimensional packing problems: a survey, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, Modeling multistage cutting stock problems, The nesting problem in the leather manufacturing industry, Cutting aluminium coils with high length variabilities, Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems, A new algorithm for the integer knapsack problem and its parallelization, Interactive procedures in large-scale two-dimensional cutting stock problems, Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement, Solving the pallet loading problem, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Manufacturer's mixed pallet design problem, An enumeration scheme to generate constrained exact checkerboard patterns, Simple block patterns for the two-dimensional cutting problem, Improved local search algorithms for the rectangle packing problem with general spatial costs, Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets, Strip generation algorithms for constrained two-dimensional two-staged cutting problems, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Generating optimal two-section cutting patterns for rectangular blanks, An improved typology of cutting and packing problems, A hybrid genetic algorithm for the two-dimensional single large object placement problem, Models and algorithms for three-stage two-dimensional bin packing, A note on the approximability of cutting stock problems, An integrated cutting stock and sequencing problem, Optimising the cutting of wood fibre plates in the hardboard industry, The pallet packing problem for non-uniform box sizes, Analysis of distributed genetic algorithms for solving cutting problems, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, An approach to two-dimensional cutting stock problems, Guillotine cutting of defective boards, A note on handling residual lengths, Shortest path algorithms for knapsack type problems, Glass cutting in a small firm, Sequential design with applications to the trim-loss problem, A multidisciplinary model for floorplan design, Linear models for 1-group two-dimensional guillotine cutting problems