自动化与信息科学期刊
每年出版 12 期
ISSN 打印: 1064-2315
ISSN 在线: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Polynomial Method for Solving Unconditional Linear Fractional Problem of Combinatorial Optimization on Arrangements
卷 49,
册 3, 2017,
pp. 46-56
DOI: 10.1615/JAutomatInfScien.v49.i3.60
摘要
The article deals with solving the linear fractional problem of combinatorial optimization on the general set of arrangements. The authors propose and substantiate the method which provides solving the finite sequence of linear unconditional problems of combinatorial optimization on arrangements. Theoretical estimates of the formulated algorithm are obtained, its polynomiality is proved.
键词: polynomial method, unconditional linear fractional problem, combinatorial optimization on arrangements, theoretical estimates
对本文的引用
-
Barbolina Tetiana, Estimates of objective function minimum for solving linear fractional unconstrained combinatorial optimization problems on arrangements, Physico-mathematical modelling and informational technologies, 32, 2021. Crossref
644 文章浏览量
9 文章下载
统计数据
相似内容的文章:
最新一期
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020