图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Solving of Some Problems of Combinatorial Optimization on Arrangements and Permutations of Game Type

卷 38, 册 5, 2006, pp. 34-45
DOI: 10.1615/J Automat Inf Scien.v38.i5.40
Get accessGet access

摘要

We construct and investigate mathematical models of optimization problems on arrangements and permutations of game type, for which both players have combinatorial restrictions for use of their strategies. For problems of 2 × n and 2 × m dimension modified graphical method is suggested.

对本文的引用
  1. Iemetsa O. O., Yemetsa O. O., Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements, Cybernetics and Systems Analysis, 48, 4, 2012. Crossref

  2. Iemetsa O. A., Olkhovskaja E. V., Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements, Cybernetics and Systems Analysis, 49, 1, 2013. Crossref

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain