Approximation Algorithms for Constrained Resource Allocation
- 83 Downloads
In the paper the problem of effective allocation of a single resource in manufacturing or logistic systems is considered. In order to reduce additional costs, the cardinality constraints are imposed that allow one to allocate the resource only to the limited number of operations. This problem is NP-hard. Two approximation algorithms are proposed and their properties are analyzed. In particular, the worst-case performance of these algorithms is studied, and the results of their experimental comparison are presented.
KeywordsResource allocation Cardinality constraints Approximation algorithms Worst-case analysis
- 3.de Farias Jr., I.R., Nemhauser, G.L.: A polyhedral study of the cardinality constrained knapsack problem. Mathematical Programming Ser. A 96, 439–467 (2003)Google Scholar
- 7.Pieńkosz, K.: Reduction strategies for the cardinality constrained knapsack problem. In: 22nd IEEE International Conference on Methods and Models in Automation and Robotics, pp. 945–948 (2017). https://doi.org/10.1109/MMAR.2017.8046956