Upper bounds and algorithms for the maximum cardinality bin packing problem
Authors:
- Martine LabbéMLMartine Labbé
- Gilbert LaporteGLGilbert Laporte
- Silvano MartelloSMSilvano Martello
- 1 September 2003
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 149 (3) , 490-498
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Solving Multiple Knapsack Problems by Cutting PlanesSIAM Journal on Optimization, 1996
- An exact algorithm for the dual bin packing problemOperations Research Letters, 1995
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- Probabilistic analysis of a heuristics for the dual bin packing problemInformation Processing Letters, 1989
- Probabilistic bounds for dual bin-packingActa Informatica, 1985
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage AllocationSIAM Journal on Computing, 1979
- Bin packing: Maximizing the number of pieces packedActa Informatica, 1978