The paper deals with the non-homogeny discrete resource allocation to groups of customers with non-linear profit functions. The fast hierarchical greedy algorithms are presented and investigated. The exact upper boundwas found for complexity of the algorithm. The experiments prove the advantage of the modification of the algorithm.
This work is licensed under a Creative Commons Attribution 4.0 International License.