Cited in
(19)- The one-dimensional cutting stock problem with usable leftovers -- a survey
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- A dynamic adaptive local search algorithm for the circular packing problem
- Optimising the cutting of wood fibre plates in the hardboard industry
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- A combined approach to the solution to the general one-dimensional cutting stock problem
- A hybrid approach for optimization of one-dimensional cutting
- A sequential heuristic procedure for one-dimensional cutting
- An enumeration scheme to generate constrained exact checkerboard patterns
- An integrated cutting stock and sequencing problem
- The two-dimensional cutting stock problem within the roller blind production process
- The constrained compartmentalised knapsack problem
- Irregular packing: MILP model based on a polygonal enclosure
- Evaluation of algorithms for one-dimensional cutting
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- The cutting stock problem in a hardboard industry: A case study.
- Cutting optimization of structural tubes to build agricultural light aircrafts
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
This page was built for publication: Cutting and packing. Special issue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127202)
