ライブラリ登録: Guest
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
Get accessGet access

要約

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.

によって引用された
  1. 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

Begell Digital Portal Begellデジタルライブラリー 電子書籍 ジャーナル 参考文献と会報 リサーチ集 価格及び購読のポリシー Begell House 連絡先 Language English 中文 Русский Português German French Spain