Efficient algorithm for the constrained two-dimensional cutting stock problem
From MaRDI portal
Recommendations
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A recursive algorithm for constrained two-dimensional cutting problems
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Exact solutions for constrained two-dimensional cutting problems
Cited in
(27)- A recursive algorithm for constrained two-dimensional cutting problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Simple block patterns for the two-dimensional cutting problem
- Algorithms for the constrained two-staged two-dimensional cutting problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem
- Fast pattern-based algorithms for cutting stock
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- An approach to two-dimensional cutting stock problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- scientific article; zbMATH DE number 710068 (Why is no real title available?)
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- 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
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems
- scientific article; zbMATH DE number 7708784 (Why is no real title available?)
- 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
- Algorithms for the one-dimensional two-stage cutting stock problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- An exact algorithm for generating homogeneous T-shape cutting patterns
This page was built for publication: Efficient algorithm for the constrained two-dimensional cutting stock problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767721)
