Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
From MaRDI portal
Recommendations
- UGC: An algorithm for two-stage unconstrained guillotine cutting
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An algorithm for the 2D guillotine cutting stock problem
Cited in
(only showing first 100 items - show all)- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A branch and bound algorithm for the strip packing problem
- A recursive algorithm for constrained two-dimensional cutting problems
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- UGC: An algorithm for two-stage unconstrained guillotine cutting
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- Cutting stock problems and solution procedures
- An and-or-graph approach for two-dimensional cutting problems
- Composite stock cutting through simulated annealing
- Packing problems
- 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 algorithm for the 2D guillotine cutting stock problem
- On the effectivity of gradient methods for cutting stock problems
- 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
- The cutting stock problem in a hardboard industry: A case study.
- Exact algorithms for the guillotine strip cutting/packing problem.
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- On the two-dimensional knapsack problem
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- Evaluation of algorithms for one-dimensional cutting
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Exact algorithms for the two-dimensional guillotine knapsack
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Heuristic methods and applications: A categorized survey
- Knowledge-based systems for cutting stock problems
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- A population heuristic for constrained two-dimensional non-guillotine cutting
- MPQ-trees for the orthogonal packing problem
- A new dynamic programming procedure for three-staged cutting patterns
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- The maximum diversity assortment selection problem
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- An EDA for the 2D knapsack problem with guillotine constraint
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
- An enumeration scheme to generate constrained exact checkerboard patterns
- A polynomial algorithm for one problem of guillotine cutting
- Simple block patterns for the two-dimensional cutting problem
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- Generating optimal two-section cutting patterns for rectangular blanks
- An improved typology of cutting and packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- An integrated cutting stock and sequencing problem
- Optimising the cutting of wood fibre plates in the hardboard industry
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- 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
- Using GPU computing for solving the two-dimensional guillotine cutting problem
- MPQ-trees for orthogonal packing problem
- Combinatorial Benders' cuts for the strip packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- Bounds for Two-Dimensional Cutting
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- A simple randomized algorithm for two-dimensional strip packing
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Models and algorithms for packing rectangles into the smallest square
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- scientific article; zbMATH DE number 3958766 (Why is no real title available?)
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
- scientific article; zbMATH DE number 1784423 (Why is no real title available?)
- scientific article; zbMATH DE number 2146649 (Why is no real title available?)
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- scientific article; zbMATH DE number 2106794 (Why is no real title available?)
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Recursive algorithm for the two‐dimensional cutting problem of punched strips
This page was built for publication: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718470)
