Place of publishing:
Subject and Keywords:
Problem plecakowy ; Analiza probabilistyczna ; Lagrange ; Probabilistic analysis ; Maximum set packing problem ; Knapsack problem ; Optimal solution ; Rozwiązanie optymalne ; Pakowanie ; Dual estimations
The paper deals with the well known set packing problem and its special case when number of subsets is maximized. It is assumed that some of the problem coefficients are realizations of mutually independent random variables. Asymptotical probabilistic properties of selected problem characteristics are investigated for the variety of possible instances of the problem.
Language of abstract:
Projects co-financed by:
Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.
This content is hosted outside the digital library.
Click the link below to view the content.https://www.ibspan.waw.pl/~alex/OZwRCIN/WA777_113370_RB-2008-26_Probabilistic%20Analysis%20of%20the%20Maximum%20Set%20Packing%20Problem_content.pdf