Cutting and packing. Special issue

zbMath0904.00026MaRDI QIDQ1127202

No author found.

Publication date: 5 January 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Special issuePackingCutting

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx)

Related Items (18)

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

This page was built for publication: Cutting and packing. Special issue