Доступ предоставлен для: 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 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 Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции Цены и условия подписки Begell House Контакты Language English 中文 Русский Português German French Spain