scientific article; zbMATH DE number 3954634
From MaRDI portal
Publication:3724077
Recommendations
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Cutting stock problems and solution procedures
- A Two-phase Heuristic for the Two-dimensional Cutting-stock Problem
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- An approach to two-dimensional cutting stock problems
Cited in
(16)- A recursive algorithm for constrained two-dimensional cutting problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Knowledge based approach to the cutting stock problem
- A recursive exact algorithm for weighted two-dimensional cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- The cutting stock problem in a hardboard industry: A case study.
- Exact algorithms for the guillotine strip cutting/packing problem.
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- scientific article; zbMATH DE number 7647855 (Why is no real title available?)
- scientific article; zbMATH DE number 7708784 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724077)
