The two-dimensional finite bin packing problem. II: New lower and upper bounds
type: Item
instance of: scholarly article
title: The two-dimensional finite bin packing problem. II: New lower and upper bounds
zbMATH Open document ID: 1097.90033
author: Aristide Mingozzi
author: Marco A. Boschetti
published in: 4OR
publication date: 2004-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2073841
zbMATH Keywords: cutting and packing
zbMATH Keywords: lower bounds
zbMATH Keywords: heuristic algorithms
MaRDI profile type: Publication
full work available at URL: s10288-002-0006-y
OpenAlex ID: W2029484438
DOI: 10.1007/S10288-002-0006-Y
Recommended article: The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
Recommended article: A computational study of lower bounds for the two dimensional bin packing problem
Recommended article: New approximability results for two-dimensional bin packing
Recommended article: New Approximability Results for Two-Dimensional Bin Packing
Recommended article: A new lower bound for the non-oriented two-dimensional bin-packing problem
Recommended article: Q5501259
Recommended article: A lower bound for the non-oriented two-dimensional bin packing problem
Recommended article: A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
Recommended article: Two-Bounded-Space Bin Packing Revisited
Recommended article: Two-Dimensional Finite Bin-Packing Algorithms
description: scientific article; zbMATH DE number 2073841