New bin packing fast lower bounds

Computers and Operations Research

Volumn 34, Issue 11, 2007, Pages 3439-3457

  Crainic, Teodor Gabriel ^a   Perboli, Guido ^b   Pezzuto, Miriam ^b   Tadei, Roberto ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Bin packing; Lower bounds

Indexed keywords

BINS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PACKING;

BIN PACKING; COMPUTATIONAL EFFORT; LOWER BOUNDS;

PROBLEM SOLVING;

BINS; OPERATIONS RESEARCH; OPTIMIZATION;

EID: 34047189157     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.02.007     Document Type: Article

References (21)

1. Garey M.R., and Johnson D.S. Computers and intractability (1979), W. H. Freeman and Co., New York, USA
2. Chen B., and Srivastava B. An improved lower bound for the bin packing problem. Discrete Applied Mathematics 66 (1996) 81-94
3. Crainic TG, Perboli G, Pezzuto M, Tadei R. Computing the asymptotic worst-case of bin packing lower bounds. European Journal of Operational Research, forthcoming.
4. Martello S., and Toth P. Knapsack problems-algorithms and computer implementations (1990), Wiley, Chichester, UK
5. Martello S., and Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28 1 (1990) 59-70
6. Fekete S.P., and Schepers J. New classes of lower bounds for bin packing problems. Mathematical Programming 91 1 (2001) 11-31
7. Haouaria M., and Gharbia A. Fast lifting procedures for the bin packing problem. Discrete Optimization 2 (2005) 201-218
8. Labbé M., Laporte G., and Mercure H. Capacitated vehicle routing on trees. Operations Research 39 (1991) 616-622
9. Coffman E.G., Garey M.R., and Johnson D.S. Bin packing approximation algorithms: a survey. In: Hochbaum D.S. (Ed). Approximation algorithms for NP-hard problems (1997), PWS Publishing Company, Boston, MA 46-93
10. Bourjolly J.M., and Rebetez V. An analysis of lower bound procedures. Computers and Operations Research 32 3 (2005) 395-405
11. Perboli G. Bounds and heuristics for the packing problems. PhD thesis, Politecnico di Torino, available at 〈http://www.orgroup.polito.it/People/perboli/phd-thesys.pdf〉, 2002.
12. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research 9 (1961) 849-859
13. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem-part ii. Operations Research 11 (1963) 863-888
14. Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 86 3 (1999) 565-594
15. Scholl A., Klein R., and Jürgens C. Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers and Operations Research 24 7 (1997) 627-645
16. Schwerin P., and Wäscher G. The bin-packing problem: a problem generator and some numerical experiments with ffd packing and mtp. International Transactions in Operational Research 4 5/6 (1997) 377-389
17. Wäscher G., and Gau T. Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18 (1996) 131-144
18. Beasley J.E. Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society 41 11 (1990) 1069-1072
19. Falkenauer E. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2 1 (1996) 5-30
20. Alvim A.C.F., Ribeiro C.C., Glover F., and Aloise D.J. A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics 10 2 (2004) 205-229
21. Chao H., Harper M.P., and Quong R.W. A tight lower bound for optimal bin packing. Operations Research Letters 18 3 (1995) 133-138