An Algorithms for Solving Extended Bin Packing Problem for Efficient Storage of Digital Information

In this research we performed comparative analysis of possible solutions for the extended Bin Packing problem, belonging to the group of NP-Complete optimization problems for organization and storage of digital information. The objective was finding a dispersion of N elements from n different classes among the number of resource units while meeting resource capacity. In addition, dispersion elements of this class between different resource units must be minimal. The problem has been defined literally and in mathematical terms and the approach for solution was shown by Greedy Branch and Bound. The advantages and shortcomings of different solution methods are discussed.