New lower bounds for the three-dimensional finite bin packing problem
type: Item
instance of: scholarly article
title: New lower bounds for the three-dimensional finite bin packing problem
zbMATH Open document ID: 1069.90085
published in: Discrete Applied Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2083780
zbMATH Keywords: Bin packing
zbMATH Keywords: Lower bound
zbMATH Keywords: Combinatorial optimization
author: Marco A. Boschetti
MaRDI profile type: Publication
full work available at URL: j.dam.2003.08.004
OpenAlex ID: W1986228108
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Q3145801
cites work: Q3347319
cites work: Packing problems
cites work: Q4398379
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: Q3840364
cites work: Q4198056
cites work: Two-dimensional packing problems: a survey
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: Exact solution of the two-dimensional finite bin packing problem
DOI: 10.1016/J.DAM.2003.08.004
description: scientific article; zbMATH DE number 2083780