Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  approximation algorithms
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Content available remote

A computational study of approximation algorithms for a minmax resource allocation problem

100%
PRZYBYSŁAWSKI B., KASPERSKI A.
Operations Research and Decisions
|
2012
|
vol. 22
|
issue 2
35-43
EN
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.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.