Generalized Bin Covering Problem in Integer Linear Programming

In this paper, we study the GENERALIZED Bin COVERING problem. This problem is an NP-hard optimization problem, Since there is no way to find optimal solution or a solution near to optimal, This paper try using Integer Linear programming as a method to find optimal for not large instances.

کلیدواژه ها:

Generalized Bin covering Problem ، Integer linear Programming