The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
type: Item
instance of: scholarly article
title: The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
zbMATH Open document ID: 1062.90051
author: Aristide Mingozzi
author: Marco A. Boschetti
published in: 4OR
publication date: 2004-05-18T00:00:00Z
review text: The problem: \(n\) item-rectangles, each with a given width \(w_j\) and a given height \(h_j\), \(1 \leq j \leq n\), need to be packed in as few bin-rectangles (each having width \(W\) and height \(H\)) as possible such that no pair of item-rectangles overlap, and such that the item-rectangles are placed axis-parallel, with fixed orientation. The results: after having reviewed the known lower bounds due to \textit{S. Martello} and \textit{D. Vigo} [Manage. Sci. 44, No.3, 388-399 (1998; Zbl 0989.90114)], and \textit{S. Fekete} and \textit{J. Schepers} [On more-dimensional packing II: Bounds. (English). Report 97.289, Universität zu Köln. (2000)], four new lower bounds are proposed. The relation between these bounds and previous bounds is investigated, as well as the algorithmic complexity of computing these new lower bounds.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2064344
zbMATH Keywords: bin packing
zbMATH Keywords: lower bounds
reviewed by: Frits C. R. Spieksma
MaRDI profile type: Publication
full work available at URL: s10288-002-0005-z
OpenAlex ID: W2029621259
DOI: 10.1007/S10288-002-0005-Z
description: scientific article; zbMATH DE number 2064344