1. A hybrid improvement heuristic for the one-dimensional bin packing problem;Alvim;Journal of Heuristics,2004
2. Branch-and-cut algorithms for the split delivery vehicle routing problem;Archetti;European Journal of Operational Research,2014
3. Bacci, T., Nicoloso, S., 2017. A heuristic algorithm for the bin packing problem with conflicts on interval graphs. arXiv:1707.00496 [math.CO].
4. Bacci, T., Nicoloso, S., 2017. On the benchmark instances for the bin packing with conflicts. arXiv:1706.03526 [math.CO].
5. Heuristics for determining the number of warehouses for storing non-compatible products;Basnet;International Transactions in Operational Research,2005