Cutting optimization with variable-sized stock and inventory status data
From MaRDI portal
Recommendations
Cites work
- A new version of on-line variable-sized bin packing
- A typology of cutting and packing problems
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Computing Partitions with Applications to the Knapsack Problem
- scientific article; zbMATH DE number 558543 (Why is no real title available?)
- Variable Sized Bin Packing
Cited in
(7)- The one-dimensional cutting stock problem with usable leftovers -- a survey
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
- An improved typology of cutting and packing problems
- Renovation of the cutting stock process
- Optimization of a line-cutting procedure for ship hull construction by an effective tabu search
- scientific article; zbMATH DE number 3914058 (Why is no real title available?)
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
This page was built for publication: Cutting optimization with variable-sized stock and inventory status data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4468878)