Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
From MaRDI portal
Recommendations
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- scientific article; zbMATH DE number 3954634
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- A near-optimal solution to a two-dimensional cutting stock problem
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Algorithms for the constrained two-staged two-dimensional cutting problem
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- An approach to two-dimensional cutting stock problems
Cited in
(30)- A recursive algorithm for constrained two-dimensional cutting problems
- Solution for the constrained Guillotine cutting problem by simulated annealing
- 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 written by J. F. Oliveira and J. S. Ferraira
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Exact algorithms for the guillotine strip cutting/packing problem.
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Exact solution techniques for two-dimensional cutting and packing
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- An EDA for the 2D knapsack problem with guillotine constraint
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- 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
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- 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 heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Multi-dimensional bin packing problems with guillotine constraints
This page was built for publication: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272900)
