Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
From MaRDI portal
Publication:4849262
Recommendations
Cited in
(18)- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two-staged guillotine cut, two-dimensional bin packing optimisation with flexible bin size for steel mother plate design
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- scientific article; zbMATH DE number 1094768 (Why is no real title available?)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- An exact algorithm for the knapsack sharing problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Solving a large cutting problem in the glass manufacturing industry
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A linear optimization approach to the combined production planning model
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- The cutting stock problem in a hardboard industry: A case study.
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
This page was built for publication: Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4849262)
