Search

Your search keyword '"Szkatuła, Krzysztof"' showing total 9 results
Start Over Author "Szkatuła, Krzysztof"
9 results on '"Szkatuła, Krzysztof"'

1. When Two-Constraint Binary Knapsack Problem is Equivalent to Classical Knapsack Problem?

Author

Szkatuła, Krzysztof, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Atanassov, Krassimir T., editor, Atanassova, Vassia, editor, Kałuszko, Andrzej, editor, Krawczak, Maciej, editor, Owsiński, Jan W., editor, Sotirov, Sotir S., editor, Sotirova, Evdokia, editor, Szmidt, Eulalia, editor, and Zadrożny, Sławomir, editor

Published
2021
Full Text
View/download PDF

6. Average case analysis of the set packing problem.

Author

Szkatuła, Krzysztof

Subjects
PROBABILITY theory, SUBSET selection, APPROXIMATION theory, OPTIMAL control theory, MATHEMATICAL models
Abstract

The paper deals with the well known set packing problem and its special case, when the number of subsets is maximized. It is assumed that some of the problem coefficients are realizations of mutually independent random variables. Average case (i.e. asymptotical probabilistic) properties of selected problem characteristics are investigated for the variety of possible instances of the problem. The important results of the paper are: • Behavior of the optimal solution values of the set packing problem is presented for the special asymptotic case, where mutual asymptotical relation between m (number of elements of the packed set) and n (number of sets provided) is playing an essential role. • Probability of reaching feasible solution is reasonably high (i.e. ⩾ 2/e, 2/e ≈ 0.736); moreover, it may be set arbitrarily close to 1 (e.g. 0.999), although the deterioration in the quality of approximation of the behavior of the optimal solution values may be substantial. • Some relations between the general case of the set packing problem and its maximization for the special case are investigated. [ABSTRACT FROM AUTHOR]

Published
2014

Catalog

Books, media, physical & digital resources
See catalog results