On rates of convergence and asymptotic normality in the multiknapsack problem

In Meanti et al. (1990) an almost sure asymptotic characterization has been derived for the optimal solution value as function of the knapsack capacities, when the profit and requirement coefficients of items to be selected from are random variables. In this paper the authors establish a rate of con...

Full description

Saved in:
Bibliographic Details
Published inMathematical programming Vol. 51; no. 1-3; pp. 349 - 358
Main Authors van de Geer, Sara, Stougie, Leen
Format Journal Article
LanguageEnglish
Published 01.10.1991
Online AccessGet full text
ISSN0025-5610
1436-4646
DOI10.1007/BF01586944

Cover

More Information
Summary:In Meanti et al. (1990) an almost sure asymptotic characterization has been derived for the optimal solution value as function of the knapsack capacities, when the profit and requirement coefficients of items to be selected from are random variables. In this paper the authors establish a rate of convergence for this process using results from the theory of empirical processes.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0025-5610
1436-4646
DOI:10.1007/BF01586944