Efficient lower bounds and heuristics for the variable cost and size bin packing problem

Computers and Operations Research

Volumn 38, Issue 11, 2011, Pages 1474-1482

  Crainic, Teodor Gabriel ^b,c   Perboli, Guido ^a,b   Rei, Walter ^b,c   Tadei, Roberto ^a  

^a POLITECNICO DI TORINO   (Italy)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

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

Author keywords

Heuristics; Lower bounds; Upper bounds; Variable cost and size bin packing

Indexed keywords

BIN PACKING PROBLEM; COMPUTATIONAL EFFORT; CORRELATION VALUE; HEURISTICS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; NUMERICAL TESTS; SOLUTION METHODS; SOLUTION QUALITY; UPPER BOUNDS; VARIABLE COST AND SIZE BIN PACKING; VARIABLE COSTS;

BINS; COST ACCOUNTING; COSTS; NUMERICAL ANALYSIS; NUMERICAL METHODS;

COST BENEFIT ANALYSIS;

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

References (15)

1. S. Martello, and P. Toth Knapsack problems - algorithms and computer implementations 1990 John Wiley & Sons Chichester, UK
2. H. Dyckhoff A typology of cutting and packing problems European Journal of Operational Research 44 1990 145 159
3. G. Wäsher, H. HauBner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 2007 1109 1130 (Pubitemid 47030730)
4. Monaci M. Algorithms for packing and scheduling problems. PhD thesis, Universit di Bologna; 2002.
5. D. Pisinger, and M. Sigurd The two-dimensional bin packing problem with variable bin sizes and costs Discrete Optimization 2 2005 154 167 (Pubitemid 41023723)
6. C. Alves, and J.M. Valérion de Carvalho Accelerating column generation for variable sized bin-packing problems European Journal of Operational Research 183 2007 1333 1352 (Pubitemid 47030743)
7. I. Correia, L. Gouveia, and F. Saldanha-da-Gama Solving the variable size bin packing problem with discretized formulations Computers and Operations Research 35 2008 2103 2113 (Pubitemid 47615246)
8. N. Limão, and A.J. Venables Infrastructure, geographical disadvantage, transport costs, and trade The World Bank Economic Review 15 3 2001 451 479 (Pubitemid 34099420)
9. S.S. Seiden, R. Van Stee, and L. Epstein New bounds for variable-sized online bin packing SIAM Journal on Computing 32 2 2003 455 469
10. J. Kang, and S. Park Algorithms for the variable sized bin packing problem European Journal of Operational Research 147 2003 365 372
11. F. Vanderbeck Computational study of a column generation algorithm for bin packing and cutting stock problems Mathematical Programming 86 1996 565 594
12. D. Pisinger A minimal algorithm for the 01 knapsack problem Operations Research 45 1997 758 767
13. F. Vanderbeck Computational study of a column generation algorithm for bin packing and cutting stock problems Mathematical Programming 1999 565 594
14. S. Martello, D. Pisinger, and D. Vigo The three-dimensional bin packing problem Operations Research 48 2 2000 256 267
15. Baldi MM, Crainic TG, Perboli G, Tadei R. The generalized bin packing problem. Publication CIRRELT-2010-21. Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport. Université de Montréal, Montréal, QC, Canada, 2010.