Issue: 2012/Vol.22/No.2, Pages 35-43
A COMPUTATIONAL STUDY OF APPROXIMATION ALGORITHMS FOR A MINMAX RESOURCE ALLOCATION PROBLEM
Bogusz Przybysławski
, Adam Kasperski
Cite as: B. Przybysławski, A. Kasperski. A computational study of approximation algorithms for a minmax resource allocation problem. Operations Research and Decisions 2012: 22(2), 35-43. DOI 10.5277/ord120203
Abstract
A basic resource allocation problem with uncertain costs has been discussed. The problem is to minimize the total cost of choosing exactly p items out of n available. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a solution. This problem is known to be NP-hard, but several approximation algorithms exist. The aim of this paper is to investigate the quality of the solutions returned by these approximation algorithms. According to the results obtained, the randomized algorithms described are fast and output solutions of good quality, even if the problem size is large.
Keywords: discrete optimization, robust optimization, resource allocation, approximation algorithms
Received: Accepted: