Journal of Automation and Information Sciences
年間 12 号発行
ISSN 印刷: 1064-2315
ISSN オンライン: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Optimization on Arrangements: the Simplex Form of Polyhedron of Arrangements
巻 49,
発行 12, 2017,
pp. 14-28
DOI: 10.1615/JAutomatInfScien.v49.i12.20
Get access
要約
Determination of the simplex form of the general polyhedron of arrangements, which is necessary to use according to the Karmarkar algorithm on solving the auxiliary problems of linear programming in the methods of combinatorial cutting in the Euclidian combinatorial optimization is under consideration.
キーワード: Karmarkar algorithm, general polyhedron of arrangements, simplex form, auxiliary problems of linear programming, methods of combinatorial cutting, Euclidean combinatorial optimization
によって引用された
-
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
1185 記事の閲覧数
6 記事のダウンロード
記事の統計
類似内容の記事:
最新号
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