Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
From MaRDI portal
Publication:4272900
DOI10.1287/opre.41.4.768zbMath0782.90076OpenAlexW1993950002MaRDI QIDQ4272900
No author found.
Publication date: 2 January 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.41.4.768
artificial intelligenceorthogonal guillotine cutsBest-first searchconstrained two-dimensional cutting stock
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (28)
An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira ⋮ 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 ⋮ Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns ⋮ An exact algorithm for generating homogeneous T-shape cutting patterns ⋮ 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 heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ 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 ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ 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 ⋮ Strip generation algorithms for constrained two-dimensional two-staged cutting problems ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ 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 ⋮ Solution for the constrained Guillotine cutting problem by simulated annealing ⋮ 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 effective quasi-human based heuristic for solving the rectangle packing problem
This page was built for publication: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
