Approximation Algorithms for Constrained Resource Allocation

  • Krzysztof PieńkoszEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1196)


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.


Resource allocation Cardinality constraints Approximation algorithms Worst-case analysis 


  1. 1.
    Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123, 333–345 (2000)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)zbMATHGoogle Scholar
  3. 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
  4. 4.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Martello, S., Toth, P.: Upper bounds and algorithms for hard 0–1 knapsack problems. Oper. Res. 45, 768–778 (1997)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Mastrolilli, M., Hutter, M.: Hybrid rounding techniques for knapsack problems. Discrete Appl. Math. 154, 640–649 (2006)MathSciNetCrossRefGoogle Scholar
  7. 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).

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Warsaw University of Technology, Institute of Control and Computation EngineeringWarsawPoland

Personalised recommendations