The nesting problem in the leather manufacturing industry
type: Item
instance of: scholarly article
title: The nesting problem in the leather manufacturing industry
zbMATH Open document ID: 0831.90063
DOI: 10.1007/BF02099695
author: Jörg Heistermann
author: Thomas Lengauer
published in: Annals of Operations Research
publication date: 1995-08-27T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 790514
zbMATH Keywords: manufacturing
zbMATH Keywords: part nesting
MaRDI profile type: Publication
cites work: On random sequential packing in two and three dimensions
cites work: A algorithm for two-dimensional packing
cites work: Lower bounds for on-line two-dimensional packing algorithms
cites work: Orthogonal Packings in Two Dimensions
cites work: Shelf Algorithms for Two-Dimensional Packing Problems
cites work: Expected performance of the shelf heuristic for 2-dimensional packing
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: On Packing Two-Dimensional Bins
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Dynamic, first-fit packings in two or more dimensions
cites work: Average-case analysis of cutting and packing in two dimensions
cites work: Packings in two dimensions: Asymptotic average-case analysis of algorithms
cites work: An approach to two-dimensional cutting stock problems
cites work: Packing problems
cites work: Q3347668
cites work: The cutting stock problem in the canvas industry
cites work: Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
cites work: A Multistage Solution of the Template-Layout Problem
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
cites work: Q3140427
cites work: Two-dimensional packing: expected performance of simple level algorithms
cites work: Q3805803
cites work: Q3694703
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: A 2.5 times optimal algorithm for packing in two dimensions
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
cites work: An LP-based approach to cutting stock problems with multiple objectives
full work available at URL: https://doi.org/10.1007/bf02099695
OpenAlex ID: W2070487652
description: scientific article; zbMATH DE number 790514