An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
From MaRDI portal
Recommendations
- An algorithm for the 2D guillotine cutting stock problem
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- A recursive algorithm for constrained two-dimensional cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem
Cited in
(12)- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
- An inexact bundle approach to cutting-stock problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- An exact depth-first algorithm for the pallet loading problem
- A simulated annealing heuristic for the one-dimensional cutting stock problem
- scientific article; zbMATH DE number 710068 (Why is no real title available?)
- Packing problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- The pallet loading problem: a review of solution methods and computational experiments
- A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
This page was built for publication: An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468863)
