Abstract
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 we establish a rate of convergence for this process using results from the theory of empirical processes
| Original language | English |
|---|---|
| Pages (from-to) | 349-358 |
| Journal | Mathematical Programming |
| Volume | 51 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1991 |
Bibliographical note
0753.90045UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 6 Clean Water and Sanitation
Fingerprint
Dive into the research topics of 'On rates of convergence and asymptotic normality in the multiknapsack problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver