Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Krzysztof Szkatuła"'
Publikováno v:
Entropy, Vol 23, Iss 4, p 465 (2021)
This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of
Externí odkaz:
https://doaj.org/article/96b2fd4ef5a34e49ba37b34473650fac
Publikováno v:
Entropy
Volume 23
Issue 4
Entropy, Vol 23, Iss 465, p 465 (2021)
Volume 23
Issue 4
Entropy, Vol 23, Iss 465, p 465 (2021)
This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::311c7e8e2420da6766f616a1f762a6b0
https://pubmed.ncbi.nlm.nih.gov/33920784
https://pubmed.ncbi.nlm.nih.gov/33920784
Autor:
Krzysztof Szkatuła
Publikováno v:
Advances and New Developments in Fuzzy Logic and Technology ISBN: 9783030777159
The goal of the paper is to show when Two-Constraint 0-1 Knapsack Problem is equivalent to the single constraint Classical Knapsack Problem. In other words when one constraint is “active", and another constraint is “inactive" - the “active" one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2f59982e3352a24a5569c406ead2941
https://doi.org/10.1007/978-3-030-77716-6_27
https://doi.org/10.1007/978-3-030-77716-6_27
Autor:
Krzysztof Szkatuła
Publikováno v:
European Journal of Operational Research. 262:40-45
The paper analyzes the influence, exerted by the mutual relations of deadline intervals on behavior of the optimal solution values for the random Sequencing Jobs with Deadlines (SJD) problems. An asymptotically sub-optimal algorithm is proposed. It i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af448087c623428b79a4ee38a94a1c2a
https://doi.org/10.1016/j.ejor.2017.03.047
https://doi.org/10.1016/j.ejor.2017.03.047
Autor:
Krzysztof Szkatuła
Publikováno v:
European Journal of Operational Research. 109:160-169
In the paper an asymptotic value of the sequencing jobs with deadlines (SJD) problem is computed for the case of the random SJD problems. It is assumed that problem coefficients are realizations of independent, uniformly distributed over [0,1) random
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfc4342804fb75498c7ed98d4ee73b91
https://doi.org/10.1016/s0377-2217(97)00096-9
https://doi.org/10.1016/s0377-2217(97)00096-9
Autor:
Krzysztof Szkatuła
Publikováno v:
European Journal of Operational Research. 73:199-204
The asymptotic value of the m -constraint, n -variable, 0–1 random knapsack problem with b j ( n ) the right-hand side of the j -th constraint, m fixed, n → ∞, is computed. Previously known results have been generalized.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cce01bad5b1a84019fe83a96ef67081d
https://doi.org/10.1016/0377-2217(94)90164-3
https://doi.org/10.1016/0377-2217(94)90164-3
Publikováno v:
European Journal of Operational Research. 59:333-336
Two simple heuristic algorithms for sequencing jobs with deadlines problem are proposed. Computational results are reported. The algorithms are compared with the greedy algorithm recently presented by H.I. Stern and Z. Avivi in 1990.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4238f5f1a31dfd786ef39934a571b561
https://doi.org/10.1016/0377-2217(92)90151-x
https://doi.org/10.1016/0377-2217(92)90151-x
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.