Upper bounds and algorithms for the maximum cardinality bin packing problem

European Journal of Operational Research

Volumn 149, Issue 3, 2003, Pages 490-498

  Labbé, Martine ^a   Laporte, Gilbert ^b,d   Martello, Silvano ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b GERAD   (Canada)

^c UNIVERSITY OF BOLOGNA   (Italy)

^d UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Dual bin packing; Maximum cardinality bin packing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; OPERATIONS RESEARCH; PACKING;

DUAL BIN PACKING;

PROBLEM SOLVING;

EID: 0038577482     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00466-6     Document Type: Article

References (10)

1. Bruno J.L., Downey P.J. Probabilistic bounds for dual bin packing. Acta Informatica. 22:1985;333-345.
2. Chekuri C., Khanna S. A PTAS for the multiple knapsack problem. Proceedings of SODA'2000. 2000;213-222.
3. Coffman E.G. Jr., Leung J.Y.-T. Combinatorial analysis of an efficient algorithm for processor and storage allocation. SIAM Journal on Computing. 8:1979;202-217.
4. Coffman E.G. Jr., Leung J.Y.-T., Ting D.W. Bin packing: Maximizing the number of pieces packed. Acta Informatica. 9:1978;263-271.
5. Ferreira C.M., Martin A., Weismantel R. Solving multiple knapsack problems by cutting planes. SIAM Journal on Optimization. 6:1996;858-877.
6. Foster D.P., Vohra R.V. Probabilistic analysis for heuristics for the dual bin packing problem. Information Processing Letters. 31:1989;287-290.
7. Kellerer H. A polynomial time approximation scheme for the multiple knapsack problem. RANDOM - APPROX'99. 1999;51-62.
8. Labbé M., Laporte G., Martello S. An exact algorithm for the dual bin packing problem. Operations Research Letters. 17:1995;9-18.
9. Martello S., Toth P. Knapsack Problems. 1990;Wiley, Chichester.
10. Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics. 28:1990;59-70.