An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
From MaRDI portal
Recommendations
- Alternative approaches for one-dimensional slitting problems
- Near-optimal solutions to one-dimensional cutting stock problems
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Optimization theory application to slitted plate bending problems
- A near-optimal solution to a two-dimensional cutting stock problem
- A hybrid approach for optimization of one-dimensional cutting
- A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- scientific article; zbMATH DE number 1050896
- A combined approach to the solution to the general one-dimensional cutting stock problem
Cited in
(10)- Composite stock cutting through simulated annealing
- Knowledge based approach to the cutting stock problem
- Solving sequential interval cutting problems via dynamic programming
- Integrated defect detection and optimization for cross cutting of wooden boards
- Cost optimization for the slitting of core laminations for power transformers
- An exact model for a slitting problem in the steel industry
- Alternative approaches for one-dimensional slitting problems
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- One-dimensional stock cutting resilient against singular random defects
- Bun splitting: a practical cutting stock problem
This page was built for publication: An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804426)
