Multistage Cutting Stock Problems of Two and More Dimensions

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

Paul C. Gilmore, Ralph E. Gomory

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

Solution procedures for cutting lumber into furniture parts, Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Exact algorithm for generating two-segment cutting patterns of punched strips, On the effectivity of gradient methods for cutting stock problems, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, A new enumeration scheme for the knapsack problem, The nesting problem in the leather manufacturing industry, Cutting aluminium coils with high length variabilities, Origin and early evolution of corner polyhedra, Bin packing and cutting stock problems: mathematical models and exact algorithms, Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, Models for the two-dimensional two-stage cutting stock problem with multiple stock size, Effective methods for a container packing operation, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, The combined cutting stock and lot-sizing problem in industrial processes, Solution approaches for the cutting stock problem with setup cost, Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems, 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, The constrained compartmentalised knapsack problem, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, The computer as an aid to physical distribution management, A new algorithm for the integer knapsack problem and its parallelization, Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem, Interactive procedures in large-scale two-dimensional cutting stock problems, Two-stage general block patterns for the two-dimensional cutting problem, 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, Bun splitting: a practical cutting stock problem, Two-dimensional cutting stock problem with sequence dependent setup times, 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, A heuristic approach to minimize the number of saw cycles in small-scale furniture factories, The trim-loss and assortment problems: A survey, A new dynamic programming procedure for three-staged cutting patterns, The cutting stock problem in a hardboard industry: A case study., A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems, A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, Reducing the number of cuts in generating three-staged cutting patterns, The three-dimensional knapsack problem with balancing constraints, A linear optimization approach to the combined production planning model, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Characterization and modelling of guillotine constraints, Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study, Approximate algorithms for constrained circular cutting problems, On the two-dimensional knapsack problem, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects, T-shape homogeneous block patterns for the two-dimensional cutting problem, Cutting stock problems and solution procedures, Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement, A coupling cutting stock-lot sizing problem in the paper industry, An and-or-graph approach for two-dimensional cutting problems, A new heuristic algorithm for cuboids packing with no orientation constraints, Heuristic algorithm for a cutting stock problem in the steel bridge construction, 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, A beam search approach to solve the convex irregular bin packing problem with guillotine guts, Three-dimensional container loading models with cargo stability and load bearing constraints, Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing, Recent advances on two-dimensional bin packing problems, An integer programming model for two- and three-stage two-dimensional cutting stock problems, The two-dimensional cutting stock problem revisited, Classification and literature review of integrated lot-sizing and cutting stock problems, Algorithms for the one-dimensional two-stage cutting stock problem, Exact and hybrid methods for the multiperiod field service routing problem, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, Bidimensional packing by bilinear programming, Stock cutting to minimize cutting length, Solving the subset-sum problem with a light-based device, 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, 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, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, Integrated defect detection and optimization for cross cutting of wooden boards, 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, 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, Network flows and non-guillotine cutting patterns, Fixed charge problems with identical fixed charges, An algorithm for the 2D guillotine cutting stock problem, A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing, Heuristics for sequencing cutting patterns, Row and column generation technique for a multistage cutting stock problem, A note on handling residual lengths, A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints, Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search, Solving the pallet loading problem, 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, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, Arc-flow model for the two-dimensional guillotine cutting stock problem, Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation, Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Combinatorial Benders' Cuts for the Strip Packing Problem, An approach to two-dimensional cutting stock problems, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts, Tight approximation algorithms for geometric bin packing with skewed items, An introduction to the two‐dimensional rectangular cutting and packing problem, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, Solving a large cutting problem in the glass manufacturing industry, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, An Adaptive Optimization Method for Chop Saw Systems, Relaxation techniques applied to some loading problems, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, A mathematical modeling approach to optimize composite parts placement in autoclave, Guillotine cutting of defective boards, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Cutting and Packing Problems with Placement Constraints, Exploiting Packing Components in General-Purpose Integer Programming Solvers, Manufacturer's mixed pallet design problem, An enumeration scheme to generate constrained exact checkerboard patterns, A heuristic for the problem of one-dimensional steel coil cutting, Two-dimensional knapsack-block packing problem, An exact model for a slitting problem in the steel industry, O problema de corte de estoque em indústrias de móveis de pequeno e médio portes, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, On Guillotine Separability of Squares and Rectangles., Improved state space relaxation for constrained two-dimensional guillotine cutting problems, Simple block patterns for the two-dimensional cutting problem, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, Shortest path algorithms for knapsack type problems, Improved local search algorithms for the rectangle packing problem with general spatial costs, Analysis and modelling of a production line in a corrugated box factory, Lower bounds for three-dimensional multiple-bin-size bin packing problems, A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks, 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, An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem, A multidisciplinary model for floorplan design, A bi-objective guillotine cutting problem of stamping strips of equal circles, The pallet packing problem for non-uniform box sizes, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Exact solution techniques for two-dimensional cutting and packing, Heuristics for packing semifluids, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, The maximum diversity assortment selection problem, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings, Glass cutting in a small firm, A bi-integrated model for coupling lot-sizing and cutting-stock problems, Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem, Linear models for 1-group two-dimensional guillotine cutting problems, Container loading with multi-drop constraints, ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE, Unnamed Item, Analysis of distributed genetic algorithms for solving cutting problems, Mathematical modeling and optimal blank generation in glass manufacturing, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Sequential design with applications to the trim-loss problem, Generating optimal two-section cutting patterns for rectangular blanks, Strip based compact formulation for two-dimensional guillotine cutting problems, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints