An analysis of lower bound procedures for the bin packing problem

Computers and Operations Research

Volumn 32, Issue 3, 2005, Pages 395-405

  Bourjolly, Jean Marie ^a,c   Rebetez, Vianney ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Bin packing; Lower bounds; Performance ratio

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CODES (SYMBOLS); COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PACKING; PROBLEM SOLVING; SET THEORY;

BIN PACKING; LOWER BOUNDS; PERFORMANCE RATIO;

COMPUTER SYSTEMS;

EID: 4744350987     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00244-2     Document Type: Article

References (14)

1. Garey M.G., Johnson D.S. Computers and intractability. A guide to the theory of NP-completeness. 1979;Freeman, New York.
2. Chen C, Liu M. An application of bin packing to building block placement. International Symposium on Circuits and Systems, Philadelphia, vol. 2. 1987. p. 576-9.
3. Aveyard RL, Butler DE. Transmission terminal utilization as a bin packing problem. International Conference on Communications, Toronto, vol. 1. 1978. p. 5.3.1-5.
4. Coffman E.G., Garey M.R., Johnson D.S. An application of bin packing to mutiprocessor scheduling. SIAM Journal on Computing. 7:1978;1-17.
5. Prabhu V, Tam RMK. Bin packing applied to port allocation in a multiprocessor packet switch. International Conference on Communications, Toronto, vol. 3. 1978. p. 36.4.1-6.
6. Wee T.S., Magazine M.J. Assembly line balancing as generalized bin packing. Operations Research Letters. 1:1982;56-58.
7. Berger I., Bourjolly J.-.M., Laporte G. Branch-and-bound algorithms for the multi-product assembly line balancing problem. European Journal of Operational Research. 58:1991;215-222.
8. Labbé M., Laporte G., Mercure H. Capacitated vehicle routing on trees. Operations Research. 39:1991;616-622.
9. Coffman EG, Garey MR, Johnson DS. Approximation algorithms for bin packing - an updated survey. In: Ausiello G, Lucertini M, Serafini P, editors. Algorithm design for computer system design. Springer Verlag Wien. 1984. p. 49-106.
10. Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics. 28:1990;59-70.
11. Martello S., Toth P. Knapsack problems. Algorithms and computer implementations. 1990;Wiley, Chichester.
12. Eilon S., Christofides N. The loading problem. Management Science. 17:1971;259-267.
13. Rebetez V. Le problème de la mise en boîtes: un algorithme de résolution, Centre de recherche sur les transports, Université de Montréal, Publication 94-48, 1994.
14. Dell'Amico M., Martello S. Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing. 7:1995;191-200.