Author:
Jarboui Bassem,Ibrahim Saber,Rebai Abdelwaheb
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference19 articles.
1. Alvim, A., Ribeiro, C., Glover, F., & Aloise, D. (2004). A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10, 205–229.
2. Boschetti, M., & Mingozzi, A. (2003). The two-dimensional finite bin packing problem. Part II: new lower and upper bounds. 4OR: A Quarterly Journal of Operations Research, 1, 135–147.
3. Bourjolly, J. M., & Rebetez, V. (2005). An analysis of lower bound procedures for the bin packing problem. Computers and. Operations Research, 32(3), 395–405.
4. Carlier, J., Clautiaux, F., & Moukrim, F. (2007). New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers and Operations Research, 34, 2223–2250.
5. Chen, B., & Srivastava, B. (1996). An improved lower bound for the bin packing problem. Discrete Applied Mathematics, 66, 81–94.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献