An efficient approach for large-scale two-dimensional guillotine cutting stock problems
From MaRDI portal
Recommendations
- An algorithm for the 2D guillotine cutting stock problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- scientific article; zbMATH DE number 3954634
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
Cited in
(44)- 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
- An application of simulated annealing to the cutting stock problem
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- An algorithm for the 2D guillotine cutting stock problem
- 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 comparative numerical analysis for the guillotine two-dimensional cutting problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- A new dynamic programming procedure for three-staged cutting patterns
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- An EDA for the 2D knapsack problem with guillotine constraint
- Simple block patterns for the two-dimensional cutting problem
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Using GPU computing for solving the two-dimensional guillotine cutting 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
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine 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
- scientific article; zbMATH DE number 3954634 (Why is no real title available?)
- scientific article; zbMATH DE number 3980922 (Why is no real title available?)
- An approach to two-dimensional cutting stock problems
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- 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
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Exact algorithm for generating two-segment cutting patterns of punched strips
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- Two-stage general block patterns for the two-dimensional cutting problem
- T-shape homogeneous block patterns for the two-dimensional cutting problem
This page was built for publication: An efficient approach for large-scale two-dimensional guillotine cutting stock problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3157808)
