Upper bounds and algorithms for the maximum cardinality bin packing problem.
type: Item
instance of: scholarly article
title: Upper bounds and algorithms for the maximum cardinality bin packing problem.
zbMATH Open document ID: 1033.90108
DOI: 10.1016/S0377-2217(02)00466-6
author: Martine Labbé
author: G. Laporte
author: Silvano Martello
published in: European Journal of Operational Research
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1957053
zbMATH Keywords: Maximum cardinality bin packing
zbMATH Keywords: dual bin packing
MaRDI profile type: Publication
cites work: Probabilistic bounds for dual bin-packing
cites work: Q4952619
cites work: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
cites work: Bin packing: Maximizing the number of pieces packed
cites work: Solving Multiple Knapsack Problems by Cutting Planes
cites work: Probabilistic analysis of a heuristic for the dual bin packing problem
cites work: Q4941826
cites work: An exact algorithm for the dual bin packing problem
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Lower bounds and reduction procedures for the bin packing problem
full work available at URL: s0377-2217(02)00466-6
OpenAlex ID: W1965367287
description: scientific article; zbMATH DE number 1957053