Journal of Automation and Information Sciences
年間 12 号発行
ISSN 印刷: 1064-2315
ISSN オンライン: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Combinatorial Cutting while Solving Optimization Nonlinear Conditional Problems of the Vertex Located Sets
巻 42,
発行 5, 2010,
pp. 21-29
DOI: 10.1615/JAutomatInfScien.v42.i5.30
要約
The method of cutting for problems on combinatorial vertex located sets with nonlinear objective functions with arbitrary additional conditions is considered. The initial problem is reduced to a problem with a linear objective function. The algorithm for this method is proposed. An illustrative example is given.
キーワード: combinatorial Euclidean optimization, combinatorial vertex located sets, nonlinear objective function, combinatorial cutting method, computation algorithm
によって引用された
-
Koliechkina Liudmyla, Pichugina Oksana, Yakovlev Sergiy, A Graph-Theoretic Approach to Multiobjective Permutation-Based Optimization, in Optimization and Applications, 1145, 2020. Crossref
-
Stoyan Y. G., Yakovlev S. V., Theory and Methods of Euclidian Combinatorial Optimization: Current Status and Prospects, Cybernetics and Systems Analysis, 56, 3, 2020. Crossref
517 記事の閲覧数
5 記事のダウンロード
記事の統計
類似内容の記事:
最新号
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