Title of article
Heuristic and exact algorithms for Generalized Bin Covering Problem
Author/Authors
Jabari, S Department of Algorithms and Computation - University of Tehran , Moazzami, D Faculty of Engineering Science - College of Engineering - University of Tehran , Ghodousian, A Faculty of Engineering Science - College of Engineering - University of Tehran
Pages
10
From page
53
To page
62
Abstract
In this paper, we study the Generalized Bin Cover-
ing problem. For this problem an exact algorithm is in-
troduced 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 heuris-
tic algorithm is assessed.
Keywords
Generalized Bin Covering Problem , heuristic al- gorithm , greedy algorithm
Journal title
Astroparticle Physics
Serial Year
2016
Record number
2469523
Link To Document