Skip to main navigation Skip to search Skip to main content

On rates of convergence and asymptotic normality in the multiknapsack problem

    Research output: Contribution to JournalArticleAcademicpeer-review

    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 languageEnglish
    Pages (from-to)349-358
    JournalMathematical Programming
    Volume51
    Issue number3
    DOIs
    Publication statusPublished - 1991

    Bibliographical note

    0753.90045

    UN SDGs

    This output contributes to the following UN Sustainable Development Goals (SDGs)

    1. SDG 6 - Clean Water and Sanitation
      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