ライブラリ登録: Guest
Journal of Automation and Information Sciences

年間 12 号発行

ISSN 印刷: 1064-2315

ISSN オンライン: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Solving of Discrete Problems of Optimization with Linear-Fractional Objective Function by Branch and Bound Methods

巻 45, 発行 9, 2013, pp. 77-83
DOI: 10.1615/JAutomatInfScien.v45.i9.70
Get accessGet access

要約

Exact combinatorial method for solving the problems of discrete optimization with linear-fractional objective function is under consideration. The algorithm of branch and bound method was constructed for solving the mentioned problem.

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