An approximation scheme for strip packing of rectangles with bounded dimensions
type: Item
instance of: scholarly article
title: An approximation scheme for strip packing of rectangles with bounded dimensions
zbMATH Open document ID: 0894.68114
DOI: 10.1016/S0166-218X(97)00130-3
published in: Discrete Applied Mathematics
publication date: 1998-08-12T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 1139434
zbMATH Keywords: strip-packing problem
author: W. Fernandez de la Vega
author: V. Zissimopoulos
MaRDI profile type: Publication
cites work: A algorithm for two-dimensional packing
cites work: Orthogonal Packings in Two Dimensions
cites work: Time bounds for selection
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: The NP-completeness column: An ongoing guide
cites work: Integer Programming with a Fixed Number of Variables
description: scientific article; zbMATH DE number 1139434