A typology of cutting and packing problems
type: Item
instance of: scholarly article
title: A typology of cutting and packing problems
zbMATH Open document ID: 0684.90076
DOI: 10.1016/0377-2217(90)90350-K
author: H. Dyckhoff
published in: European Journal of Operational Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 4121767
zbMATH Keywords: cutting stock
zbMATH Keywords: trim loss
zbMATH Keywords: packing
zbMATH Keywords: container loading
zbMATH Keywords: nesting
zbMATH Keywords: typology
MaRDI profile type: Publication
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: The dissection of rectangles into squares
cites work: Q5685847
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Q3347319
cites work: Discrete-Variable Extremum Problems
cites work: Q3716813
cites work: Exact methods for the knapsack problem and its generalizations
cites work: The Loading Problem
cites work: Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
cites work: Q4198056
cites work: Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979)
cites work: A computer-based heuristic for packing pooled shipment containers
cites work: Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
cites work: Load planning for shipments of low density products
cites work: The trim-loss and assortment problems: A survey
cites work: Performance testing of rectangular parts-nesting heuristics
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Optimal and canonical solutions of the change making problem
cites work: Q3751378
cites work: Q3657445
cites work: The knapsack problem: A survey
cites work: A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
cites work: Q3805803
cites work: An LP-based approach to cutting stock problems with multiple objectives
cites work: Assembly line balancing as generalized bin packing
full work available at URL: 0377-2217(90)90350-k
OpenAlex ID: W1979415050
description: scientific article; zbMATH DE number 4121767