A lower bound for the non-oriented two-dimensional bin packing problem
type: Item
instance of: scholarly article
title: A lower bound for the non-oriented two-dimensional bin packing problem
zbMATH Open document ID: 0995.90080
DOI: 10.1016/S0166-218X(01)00253-0
author: Mauro Dell'Amico
author: Silvano Martello
author: Daniele Vigo
published in: Discrete Applied Mathematics
publication date: 2002-05-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1741962
zbMATH Keywords: cutting and packing
zbMATH Keywords: lower bound
zbMATH Keywords: branch-and-bound
Wikidata QID: Q59222293
MaRDI profile type: Publication
cites work: Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
cites work: Packing problems
cites work: Q4382664
cites work: A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: The Three-Dimensional Bin Packing Problem
cites work: Exact solution of the two-dimensional finite bin packing problem
full work available at URL: s0166-218x(01)00253-0
OpenAlex ID: W1997445317
description: scientific article; zbMATH DE number 1741962