Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items

Annals of Operations Research

Volumn 222, Issue 1, 2014, Pages 125-141

  Baldi, Mauro Maria ^a   Crainic, Teodor Gabriel ^b   Perboli, Guido ^a,c   Tadei, Roberto ^a  

^a POLITECNICO DI TORINO   (Italy)

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

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Beam search; Bin packing; Branch and price; Column generation

Indexed keywords

EID: 84958162370     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-012-1283-2     Document Type: Article

References (21)

1. Alves, C., & Valério de Carvalho, J. M. (2007). Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research, 183, 1333–1352.
2. Alves, C., & Valério de Carvalho, J. M. (2008). A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers & Operations Research, 35, 1315–1328.
3. Baldi, M. M., Crainic, T. G., Perboli, G., & Tadei, R. (2011). The generalized bin packing problem. Tech. rep., CIRRELT, CIRRELT-2011-39.
4. Baldi, M. M., Crainic, T. G., Perboli, G., & Tadei, R. (2012). The generalized bin packing problem. Transportation Research. Part E, 48(6), 1205–1220.
5. Belov, G., & Scheithauer, G. (2002). A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research, 141, 274–294.
6. Bettinelli, A., Ceselli, A., & Righini, G. (2010). A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Annals of Operations Research, 179, 221–241.
7. Chu, C., & La, R. (2001). Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing, 30, 2069–2083.
8. Correia, I., Gouveia, L., & Saldanha-da-Gama, F. (2008). Solving the variable size bin packing problem with discretized formulations. Computers & Operations Research, 35, 2103–2113.
9. Crainic, T. G., Perboli, G., Rei, W., & Tadei, R. (2011). Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Computers & Operations Research, 38, 1474–1482.
10. Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Recovering beam search: enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics, 10, 89–104.
11. Desaulniers, G., Desrosiers, J., & Solomon, M. M. (Eds.) (2005). Column generation. GERAD 25th anniversary series. Berlin: Springer. ISBN 978-0-387-25485-2.
12. Friesen, D. K., & Langston, M. A. (1986). Variable sized bin packing. SIAM Journal on Computing, 15, 222–230.
13. Haouari, M., & Serairi, M. (2009). Heuristics for the variable sized bin-packing problem. Computers & Operations Research, 36, 2877–2884.
14. Haouari, M., & Serairi, M. (2011). Relaxations and exact solution of the variable sized bin packing problem. Computational Optimization and Applications, 48, 345–368.
15. Hemmelmayr, V., Schmid, V., & Blum, C. (2012). Variable neighbourhood search for the variable sized bin packing problem. Computers & Operations Research, 39, 1097–1108.
16. Hifi, H., & Michrafy, M. (2007). Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Computers & Operations Research, 34, 2657–2673.
17. ILOG Inc (2009). IBM ILOG CPLEX v12.1 User’s Manual.
18. Kang, J., & Park, S. (2003). Algorithms for the variable sized bin packing problem. European Journal of Operational Research, 147, 365–372.
19. Martello, S., & Toth, P. (1990). Knapsack problems—algorithms and computer implementations. Chichester, UK: Wiley.
20. Monaci, M. (2002). Algorithms for packing and scheduling problems. PhD thesis, Università di Bologna, Bologna, Italy.
21. Murgolo, F. D. (1987). An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 16, 149–161.