Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
From MaRDI portal
Publication:3666624
DOI10.1287/opre.31.3.573zbMath0517.90093OpenAlexW2148404167MaRDI QIDQ3666624
No author found.
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.3.573
algorithmswaste minimizationconstrained cutting patternsconstrained two-dimensional cutting stock problemserror bounds measure
Related Items
Solution procedures for cutting lumber into furniture parts, A population heuristic for constrained two-dimensional non-guillotine cutting, An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira, Irregular polyomino tiling via integer programming with application in phased array antenna design, A block-based layer building approach for the 2D guillotine strip packing problem, On the effectivity of gradient methods for cutting stock problems, A hybrid evolutionary algorithm for the two-dimensional packing problem, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry, The nesting problem in the leather manufacturing industry, Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, Solving the pallet loading problem, An exact algorithm for generating homogeneous T-shape cutting patterns, An improved typology of cutting and packing problems, PackLib\(^{2}\): an integrated library of multi-dimensional packing problems, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A tabu search algorithm for a two-dimensional non-guillotine cutting problem, A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem, An integrated cutting stock and sequencing problem, Heuristic for constrained T-shape cutting patterns of rectangular pieces, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, A data-driven approach for mixed-case palletization with support, Interactive procedures in large-scale two-dimensional cutting stock problems, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, Exact solutions for constrained two-dimensional cutting problems, An analytical model for the container loading problem, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, The off-line group seat reservation problem, An EDA for the 2D knapsack problem with guillotine constraint, Two dimensional guillotine cutting stock and scheduling problem in printing industry, 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 NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, Relaxation techniques applied to some loading problems, Exact algorithms for the guillotine strip cutting/packing problem., An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems, A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems., Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns, On the two-dimensional knapsack problem, Cutting stock problems and solution procedures, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, An enumeration scheme to generate constrained exact checkerboard patterns, Limiting the number of each piece in two-dimensional cutting stock patterns, Knowledge based approach to the cutting stock problem, Packing problems, Heuristic approaches for the two- and three-dimensional knapsack packing problem, Exact algorithms for the two-dimensional guillotine knapsack, An efficient deterministic heuristic for two-dimensional rectangular packing, Multi-dimensional bin packing problems with guillotine constraints, The pallet packing problem for non-uniform box sizes, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, The maximum diversity assortment selection problem, Solution for the constrained Guillotine cutting problem by simulated annealing, An algorithm for the two-dimensional assortment problem, The solution of two-stage guillotine cutting stock problems having extremely varying order demands, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, A recursive algorithm for constrained two-dimensional cutting problems, The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems, An improved version of Wang's algorithm for two-dimensional cutting problems, Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, An effective quasi-human based heuristic for solving the rectangle packing problem, Fixed charge problems with identical fixed charges, An algorithm for the 2D guillotine cutting stock problem, Strip based compact formulation for two-dimensional guillotine cutting problems, 2DPackLib: a two-dimensional cutting and packing library
