IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v147y2003i2p365-372.html
   My bibliography  Save this item

Algorithms for the variable sized bin packing problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Mauro Baldi & Teodor Crainic & Guido Perboli & Roberto Tadei, 2014. "Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items," Annals of Operations Research, Springer, vol. 222(1), pages 125-141, November.
  2. Deshi Ye & Feng Xie & Guochuan Zhang, 2022. "Truthful mechanism design for bin packing with applications on cloud computing," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2224-2245, November.
  3. Qin, Hu & Zhang, Zizhen & Qi, Zhuxuan & Lim, Andrew, 2014. "The freight consolidation and containerization problem," European Journal of Operational Research, Elsevier, vol. 234(1), pages 37-48.
  4. Hu, Qian & Wei, Lijun & Lim, Andrew, 2018. "The two-dimensional vector packing problem with general costs," Omega, Elsevier, vol. 74(C), pages 59-69.
  5. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "An asymptotic approximation scheme for the concave cost bin packing problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 582-586, December.
  6. Lewis, R. & Song, X. & Dowsland, K. & Thompson, J., 2011. "An investigation into two bin packing problems with ordering and orientation implications," European Journal of Operational Research, Elsevier, vol. 213(1), pages 52-65, August.
  7. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
  8. Hu, Qian & Lim, Andrew & Zhu, Wenbin, 2015. "The two-dimensional vector packing problem with piecewise linear cost function," Omega, Elsevier, vol. 50(C), pages 43-53.
  9. Shanshan Wang & Jinlin Li & Sanjay Mehrotra, 2021. "Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1661-1677, October.
  10. Deshi Ye & Feng Xie & Guochuan Zhang, 0. "Truthful mechanism design for bin packing with applications on cloud computing," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
  11. Hong, Shaohui & Zhang, Defu & Lau, Hoong Chuin & Zeng, XiangXiang & Si, Yain-Whar, 2014. "A hybrid heuristic algorithm for the 2D variable-sized bin packing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 95-103.
  12. de Souza, Mauricio C. & de Carvalho, Carlos R.V. & Brizon, Wellington B., 2008. "Packing items to feed assembly lines," European Journal of Operational Research, Elsevier, vol. 184(2), pages 480-489, January.
  13. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
  14. Witteman, Max & Deng, Qichen & Santos, Bruno F., 2021. "A bin packing approach to solve the aircraft maintenance task allocation problem," European Journal of Operational Research, Elsevier, vol. 294(1), pages 365-376.
  15. Chung‐Lun Li & Zhi‐Long Chen, 2006. "Bin‐packing problem with concave costs of bin utilization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 298-308, June.
  16. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2004. "ATM VP-based network design," European Journal of Operational Research, Elsevier, vol. 158(3), pages 555-569, November.
  17. Baldi, Mauro Maria & Crainic, Teodor Gabriel & Perboli, Guido & Tadei, Roberto, 2012. "The generalized bin packing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1205-1220.
  18. Borja Ena & Alberto Gomez & Borja Ponte & Paolo Priore & Diego Diaz, 2022. "Homogeneous grouping of non-prime steel products for online auctions: a case study," Annals of Operations Research, Springer, vol. 315(1), pages 591-621, August.
  19. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
  20. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.
  21. Ekici, Ali, 2023. "A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1007-1020.
  22. Goldberg, Noam & Karhi, Shlomo, 2019. "Online packing of arbitrary sized items into designated and multipurpose bins," European Journal of Operational Research, Elsevier, vol. 279(1), pages 54-67.
  23. Jasmin Grabenschweiger & Karl F. Doerner & Richard F. Hartl & Martin W. P. Savelsbergh, 2021. "The vehicle routing problem with heterogeneous locker boxes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(1), pages 113-142, March.
  24. Paquay, Célia & Limbourg, Sabine & Schyns, Michaël, 2018. "A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints," European Journal of Operational Research, Elsevier, vol. 267(1), pages 52-64.
  25. Qi Zhang & Shixin Liu & Ruiyou Zhang & Shujin Qin, 2021. "Column generation algorithms for mother plate design in steel plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 127-153, March.
  26. van der Gaast, J.P. & Rietveld, C.A. & Gabor, A.F. & Zhang, Y., 2011. "A Local Search Algorithm for Clustering in Software as a Service Networks," ERIM Report Series Research in Management ERS-2011-004-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  27. Mohamed Maiza & Abdenour Labed & Mohammed Radjef, 2013. "Efficient algorithms for the offline variable sized bin-packing problem," Journal of Global Optimization, Springer, vol. 57(3), pages 1025-1038, November.
  28. Xueqi Wu & Zhi‐Long Chen, 2022. "Fulfillment scheduling for buy‐online‐pickup‐in‐store orders," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2982-3003, July.
  29. Özlük, Özgür & Elimam, Abdelghani A. & Interaminense, Eduardo, 2010. "Optimum service capacity and demand management with price incentives," European Journal of Operational Research, Elsevier, vol. 204(2), pages 316-327, July.
  30. Andrea Bettinelli & Alberto Ceselli & Giovanni Righini, 2010. "A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint," Annals of Operations Research, Springer, vol. 179(1), pages 221-241, September.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.