Optimization Letters

, Volume 13, Issue 2, pp 379–398 | Cite as

New formulations for Variable Cost and Size Bin Packing Problems with Item Fragmentation

  • Marco CasazzaEmail author
Original Paper


In the Bin Packing Problem with Item Fragmentation a set of items of known weight and a set of bins of limited capacity are given; the task is to find the minimum cost assignment of items to bins without exceeding their capacity. However, contrary to the classical Bin Packing Problem, items can be split and fractionally assigned to different bins at a cost. In this paper we generalize models and properties from the literature by considering a set of heterogeneous bins, possibly having different cost and capacity. We prove that such a natural extension changes substantial features of the problem. We propose both compact and extended formulations and a branch-and-price algorithm that combines column generation techniques and implicit enumeration strategies to achieve guarantees on the optimality of the solutions. We present the results of an extensive experimental campaign proving that our algorithm outperforms general purpose commercial solvers by orders of magnitude.


Bin Packing Item Fragmentation Variable Cost and Size Column generation 



Project partially funded by Regione Lombardia, POR FESR 2014-2020 project AD-COM.


  1. 1.
    Achterberg, T.: Scip: solving constraint integer programs. Math. Program. Comput. 1(1), 1–41 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Casazza, M., Ceselli, A.: Mathematical programming algorithms for bin packing problems with item fragmentation. Comput. Oper. Res. 46, 1–11 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Casazza, M., Ceselli, A.: Column generation for the variable cost and size bin packing problem with fragmentation. Electron. Notes Discrete Math. 55, 61–64 (2016)CrossRefzbMATHGoogle Scholar
  4. 4.
    Casazza, M., Ceselli, A.: Exactly solving packing problems with fragmentation. Comput. Oper. Res. 75, 202–213 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Correia, I., Gouveia, L., da Gama, F.S.: Solving the variable size bin packing problem with discretized formulations. Comput. Oper. Res. 35(6), 2103–2113 (2008). Part Special Issue: OR Applications in the Military and in Counter-TerrorismMathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    CPLEX Development Team: Ibm ilog cplex optimization studio: Cplex user’s manual - version 12 release 6. Tech. rep, IBM corp (2014)Google Scholar
  7. 7.
    Crainic, T.G., Perboli, G., Rei, W., Tadei, R.: Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput. Oper. Res. 38(11), 1474–1482 (2011)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Dantzig, G., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101–111 (1960)CrossRefzbMATHGoogle Scholar
  9. 9.
    LeCun, B., Mautor, T., Quessette, F., Weisser, M.A.: Bin packing with fragmentable items: presentation and approximations. Theor. Comput. Sci. 602, 50–59 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Mandal, C., Chakrabarti, P., Ghose, S.: Complexity of fragmentable object bin packing and an application. Comput. Math. Appl. 35(11), 91–97 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)zbMATHGoogle Scholar
  12. 12.
    Menakerman, N., Rom, R.: Bin Packing with Item Fragmentation, pp. 313–324. Springer, Berlin (2001)zbMATHGoogle Scholar
  13. 13.
    Naaman, N., Rom, R.: Packet scheduling with fragmentation. In: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 427–436 vol. 1 (2002)Google Scholar
  14. 14.
    Secci, S., Ceselli, A., Malucelli, F., Pattavina, A., Sansò, B.: Direct optimal design of a quasi-regular composite-star core network. In: IEEE Proceedings of DRCN, pp. 7–10 (2007)Google Scholar
  15. 15.
    Shachnai, H., Tamir, T., Yehezkely, O.: Approximation schemes for packing with item fragmentation. Theory Comput. Syst. 43(1), 81–98 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Shachnai, H., Yehezkely, O.: Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs, pp. 482–493. Springer, Berlin (2007)zbMATHGoogle Scholar
  17. 17.
    Vanderbeck, F.: Implementing Mixed Integer Column Generation, pp. 331–358. Springer US, Boston (2005)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Dipartimento di InformaticaUniversità degli Studi di MilanoCremaItaly

Personalised recommendations