Journal of Automation and Information Sciences
年間 12 号発行
ISSN 印刷: 1064-2315
ISSN オンライン: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
The Solution of a Minimization Problem of the Weighted Length of a Connecting Grid by Branch and Bound Method
巻 44,
発行 7, 2012,
pp. 22-33
DOI: 10.1615/JAutomatInfScien.v44.i7.30
要約
The branch and bound method has been offered and realized for a minimization problem of the weighted length of a connecting grid at linear placing of rectangular elements. The rule of branching of admissible set on subsets has been considered. The estimation of an admissible set has been offered and proved. The illustrative example has been given.
キーワード: minimization problem, connecting grid, linear placing, rectangular elements, admissible subset
によって引用された
-
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
368 記事の閲覧数
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