In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
Jabari, S., Moazzami, D., & Ghodousian, A. (2016). Heuristic and exact algorithms for Generalized Bin Covering Problem. Journal of Algorithms and Computation, 47(1), 53-62. doi: 10.22059/jac.2016.7936
MLA
S. Jabari; Dara Moazzami; A. Ghodousian. "Heuristic and exact algorithms for Generalized Bin Covering Problem". Journal of Algorithms and Computation, 47, 1, 2016, 53-62. doi: 10.22059/jac.2016.7936
HARVARD
Jabari, S., Moazzami, D., Ghodousian, A. (2016). 'Heuristic and exact algorithms for Generalized Bin Covering Problem', Journal of Algorithms and Computation, 47(1), pp. 53-62. doi: 10.22059/jac.2016.7936
VANCOUVER
Jabari, S., Moazzami, D., Ghodousian, A. Heuristic and exact algorithms for Generalized Bin Covering Problem. Journal of Algorithms and Computation, 2016; 47(1): 53-62. doi: 10.22059/jac.2016.7936
)