1. Bacci, T.: http://www.iasi.cnr.it/~tbacci/ (2017)
2. Bacci, T., Nicoloso, S.: A heuristic algorithm for the bin packing problem with conflicts on interval graphs (2017). arXiv:1707.00496 [math.CO]
3. Basnet, C., Wilson, J.: Heuristics for determining the number of warehouses for storing non-compatible products. Int. Trans. Oper. Res. 12, 527–538 (2005)
4. Brandão, F., Pedroso, J.P.: Bin packing and related problems: general arc-flow formulation with graph compression. Comput. Oper. Res. 69, 56–67 (2016)
5. Capua, R., Frota, Y., Vidal, T., Ochi, L.S.: Um algoritmo heurìstico para o problema de bin packing com conflitos (2015). Manuscript http://www.din.uem.br/~ademir/sbpo/sbpo2015/pdf/146111.pdf