%0 Journal Article
%T Heuristic and exact algorithms for Generalized Bin Covering Problem
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Jabari, S.
%A Moazzami, Dara
%A Ghodousian, A.
%D 2016
%\ 03/19/2016
%V 47
%N 1
%P 53-62
%! Heuristic and exact algorithms for Generalized Bin Covering Problem
%K Generalized Bin Covering Problem
%K heuristic algorithm
%K greedy algorithm
%R 10.22059/jac.2016.7936
%X 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.
%U https://jac.ut.ac.ir/article_7936_ead5452fc8136548321a56c8bfa77888.pdf